./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dda421c3cead3fdeb93df5956242977bad12a82dded40844f224149d1433f67d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:42:06,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:42:06,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:42:06,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:42:06,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:42:06,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:42:06,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:42:06,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:42:06,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:42:06,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:42:06,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:42:06,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:42:06,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:42:06,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:42:06,988 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:42:06,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:42:06,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:42:06,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:42:06,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:42:06,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:42:06,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:42:06,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:42:06,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:42:06,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:42:06,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:42:06,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:42:06,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:42:06,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:42:06,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:42:06,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:42:06,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:42:06,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:42:06,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:42:06,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:42:06,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:42:06,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:42:06,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:42:06,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:42:06,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:42:06,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:42:06,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:42:06,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:42:06,997 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dda421c3cead3fdeb93df5956242977bad12a82dded40844f224149d1433f67d [2024-10-13 02:42:07,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:42:07,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:42:07,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:42:07,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:42:07,293 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:42:07,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i [2024-10-13 02:42:08,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:42:08,899 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:42:08,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i [2024-10-13 02:42:08,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1e465d8/fd2ecce5a5f24032b9d814fa4241dcf9/FLAG83532a4e4 [2024-10-13 02:42:08,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1e465d8/fd2ecce5a5f24032b9d814fa4241dcf9 [2024-10-13 02:42:08,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:42:08,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:42:08,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:42:08,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:42:08,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:42:08,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:42:08" (1/1) ... [2024-10-13 02:42:08,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c45efb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:08, skipping insertion in model container [2024-10-13 02:42:08,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:42:08" (1/1) ... [2024-10-13 02:42:08,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:42:09,186 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i[918,931] [2024-10-13 02:42:09,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:42:09,285 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:42:09,299 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i[918,931] [2024-10-13 02:42:09,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:42:09,370 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:42:09,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09 WrapperNode [2024-10-13 02:42:09,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:42:09,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:42:09,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:42:09,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:42:09,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,427 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 228 [2024-10-13 02:42:09,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:42:09,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:42:09,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:42:09,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:42:09,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,484 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:42:09,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:42:09,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:42:09,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:42:09,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:42:09,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (1/1) ... [2024-10-13 02:42:09,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:42:09,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:09,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:42:09,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:42:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:42:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:42:09,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:42:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:42:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:42:09,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:42:09,703 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:42:09,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:42:10,335 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:42:10,336 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:42:10,404 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:42:10,404 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:42:10,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:10 BoogieIcfgContainer [2024-10-13 02:42:10,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:42:10,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:42:10,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:42:10,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:42:10,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:42:08" (1/3) ... [2024-10-13 02:42:10,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:42:10, skipping insertion in model container [2024-10-13 02:42:10,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:09" (2/3) ... [2024-10-13 02:42:10,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:42:10, skipping insertion in model container [2024-10-13 02:42:10,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:10" (3/3) ... [2024-10-13 02:42:10,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i [2024-10-13 02:42:10,448 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:42:10,448 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:42:10,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:42:10,534 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@291aa2e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:42:10,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:42:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 58 states have internal predecessors, (87), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:42:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 02:42:10,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:10,554 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:10,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash 432868635, now seen corresponding path program 1 times [2024-10-13 02:42:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:10,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832735194] [2024-10-13 02:42:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:42:11,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832735194] [2024-10-13 02:42:11,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832735194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:11,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:11,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:42:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582253979] [2024-10-13 02:42:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:11,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:42:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:42:11,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:42:11,183 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 58 states have internal predecessors, (87), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:42:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:11,237 INFO L93 Difference]: Finished difference Result 183 states and 337 transitions. [2024-10-13 02:42:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:42:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2024-10-13 02:42:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:11,253 INFO L225 Difference]: With dead ends: 183 [2024-10-13 02:42:11,253 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 02:42:11,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:42:11,263 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:11,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:42:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 02:42:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 02:42:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:42:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 147 transitions. [2024-10-13 02:42:11,321 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 147 transitions. Word has length 204 [2024-10-13 02:42:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:11,322 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 147 transitions. [2024-10-13 02:42:11,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:42:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 147 transitions. [2024-10-13 02:42:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-13 02:42:11,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:11,327 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:11,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:42:11,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:11,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1355600286, now seen corresponding path program 1 times [2024-10-13 02:42:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:11,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530783409] [2024-10-13 02:42:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:42:11,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530783409] [2024-10-13 02:42:11,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530783409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:11,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:11,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:42:11,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123422179] [2024-10-13 02:42:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:11,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:42:11,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:42:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:42:11,905 INFO L87 Difference]: Start difference. First operand 91 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:12,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:12,013 INFO L93 Difference]: Finished difference Result 271 states and 439 transitions. [2024-10-13 02:42:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:42:12,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-13 02:42:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:12,020 INFO L225 Difference]: With dead ends: 271 [2024-10-13 02:42:12,021 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 02:42:12,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:42:12,024 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 87 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:12,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 269 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:42:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 02:42:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-10-13 02:42:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 109 states have (on average 1.4403669724770642) internal successors, (157), 109 states have internal predecessors, (157), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:42:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 289 transitions. [2024-10-13 02:42:12,080 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 289 transitions. Word has length 205 [2024-10-13 02:42:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:12,081 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 289 transitions. [2024-10-13 02:42:12,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 289 transitions. [2024-10-13 02:42:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 02:42:12,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:12,091 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:12,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:42:12,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:12,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:12,092 INFO L85 PathProgramCache]: Analyzing trace with hash 498081025, now seen corresponding path program 1 times [2024-10-13 02:42:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025425759] [2024-10-13 02:42:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:12,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:42:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025425759] [2024-10-13 02:42:13,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025425759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:13,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:13,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:42:13,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390691279] [2024-10-13 02:42:13,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:13,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:42:13,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:13,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:42:13,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:42:13,135 INFO L87 Difference]: Start difference. First operand 178 states and 289 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:13,491 INFO L93 Difference]: Finished difference Result 573 states and 919 transitions. [2024-10-13 02:42:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:42:13,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2024-10-13 02:42:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:13,498 INFO L225 Difference]: With dead ends: 573 [2024-10-13 02:42:13,498 INFO L226 Difference]: Without dead ends: 396 [2024-10-13 02:42:13,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:42:13,502 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 185 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:13,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 592 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:42:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-13 02:42:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 361. [2024-10-13 02:42:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 224 states have (on average 1.4285714285714286) internal successors, (320), 224 states have internal predecessors, (320), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-13 02:42:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 584 transitions. [2024-10-13 02:42:13,566 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 584 transitions. Word has length 206 [2024-10-13 02:42:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:13,567 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 584 transitions. [2024-10-13 02:42:13,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 584 transitions. [2024-10-13 02:42:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 02:42:13,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:13,571 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:13,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:42:13,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:13,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash 498140607, now seen corresponding path program 1 times [2024-10-13 02:42:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:13,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513536350] [2024-10-13 02:42:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:42:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513536350] [2024-10-13 02:42:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513536350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:18,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:18,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 02:42:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630014845] [2024-10-13 02:42:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:18,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 02:42:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 02:42:18,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:42:18,361 INFO L87 Difference]: Start difference. First operand 361 states and 584 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:20,427 INFO L93 Difference]: Finished difference Result 938 states and 1490 transitions. [2024-10-13 02:42:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 02:42:20,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2024-10-13 02:42:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:20,434 INFO L225 Difference]: With dead ends: 938 [2024-10-13 02:42:20,434 INFO L226 Difference]: Without dead ends: 578 [2024-10-13 02:42:20,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-13 02:42:20,437 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 254 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:20,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 614 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 02:42:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-13 02:42:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 479. [2024-10-13 02:42:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 307 states have (on average 1.4136807817589576) internal successors, (434), 307 states have internal predecessors, (434), 165 states have call successors, (165), 6 states have call predecessors, (165), 6 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-13 02:42:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 764 transitions. [2024-10-13 02:42:20,525 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 764 transitions. Word has length 206 [2024-10-13 02:42:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:20,526 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 764 transitions. [2024-10-13 02:42:20,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 764 transitions. [2024-10-13 02:42:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 02:42:20,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:20,529 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:20,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:42:20,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:20,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1199205185, now seen corresponding path program 1 times [2024-10-13 02:42:20,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:20,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115925258] [2024-10-13 02:42:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:20,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:42:21,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115925258] [2024-10-13 02:42:21,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115925258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:21,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:42:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234322153] [2024-10-13 02:42:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:21,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:42:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:42:21,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:42:21,015 INFO L87 Difference]: Start difference. First operand 479 states and 764 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:21,144 INFO L93 Difference]: Finished difference Result 1201 states and 1931 transitions. [2024-10-13 02:42:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:42:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2024-10-13 02:42:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:21,152 INFO L225 Difference]: With dead ends: 1201 [2024-10-13 02:42:21,152 INFO L226 Difference]: Without dead ends: 834 [2024-10-13 02:42:21,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:42:21,157 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 78 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:21,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 276 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:42:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-13 02:42:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 832. [2024-10-13 02:42:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 524 states have (on average 1.3931297709923665) internal successors, (730), 524 states have internal predecessors, (730), 297 states have call successors, (297), 10 states have call predecessors, (297), 10 states have return successors, (297), 297 states have call predecessors, (297), 297 states have call successors, (297) [2024-10-13 02:42:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1324 transitions. [2024-10-13 02:42:21,314 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1324 transitions. Word has length 206 [2024-10-13 02:42:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:21,315 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1324 transitions. [2024-10-13 02:42:21,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1324 transitions. [2024-10-13 02:42:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 02:42:21,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:21,318 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:21,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:42:21,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:21,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash -733450882, now seen corresponding path program 1 times [2024-10-13 02:42:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173576773] [2024-10-13 02:42:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:42:21,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:21,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173576773] [2024-10-13 02:42:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173576773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:21,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:21,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:42:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29471163] [2024-10-13 02:42:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:21,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:42:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:21,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:42:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:42:21,641 INFO L87 Difference]: Start difference. First operand 832 states and 1324 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:22,008 INFO L93 Difference]: Finished difference Result 1533 states and 2456 transitions. [2024-10-13 02:42:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:42:22,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2024-10-13 02:42:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:22,020 INFO L225 Difference]: With dead ends: 1533 [2024-10-13 02:42:22,020 INFO L226 Difference]: Without dead ends: 1171 [2024-10-13 02:42:22,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:42:22,023 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 155 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:22,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 546 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:42:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-10-13 02:42:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1162. [2024-10-13 02:42:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 718 states have (on average 1.3885793871866294) internal successors, (997), 718 states have internal predecessors, (997), 429 states have call successors, (429), 14 states have call predecessors, (429), 14 states have return successors, (429), 429 states have call predecessors, (429), 429 states have call successors, (429) [2024-10-13 02:42:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1855 transitions. [2024-10-13 02:42:22,197 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1855 transitions. Word has length 207 [2024-10-13 02:42:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:22,197 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1855 transitions. [2024-10-13 02:42:22,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1855 transitions. [2024-10-13 02:42:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 02:42:22,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:22,201 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:22,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:42:22,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:22,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1542797508, now seen corresponding path program 1 times [2024-10-13 02:42:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:22,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367290605] [2024-10-13 02:42:22,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:22,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:22,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:22,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:22,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 02:42:23,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367290605] [2024-10-13 02:42:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367290605] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:42:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791542715] [2024-10-13 02:42:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:42:23,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:23,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:42:23,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:42:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:23,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 02:42:23,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 842 proven. 138 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2024-10-13 02:42:25,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:42:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 48 proven. 141 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2024-10-13 02:42:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791542715] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:42:26,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:42:26,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2024-10-13 02:42:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289936984] [2024-10-13 02:42:26,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:42:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-13 02:42:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-13 02:42:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2024-10-13 02:42:26,427 INFO L87 Difference]: Start difference. First operand 1162 states and 1855 transitions. Second operand has 27 states, 26 states have (on average 5.0) internal successors, (130), 25 states have internal predecessors, (130), 8 states have call successors, (99), 4 states have call predecessors, (99), 8 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) [2024-10-13 02:42:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:33,103 INFO L93 Difference]: Finished difference Result 4011 states and 6193 transitions. [2024-10-13 02:42:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-10-13 02:42:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.0) internal successors, (130), 25 states have internal predecessors, (130), 8 states have call successors, (99), 4 states have call predecessors, (99), 8 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) Word has length 207 [2024-10-13 02:42:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:33,126 INFO L225 Difference]: With dead ends: 4011 [2024-10-13 02:42:33,127 INFO L226 Difference]: Without dead ends: 3308 [2024-10-13 02:42:33,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4216 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2457, Invalid=9315, Unknown=0, NotChecked=0, Total=11772 [2024-10-13 02:42:33,134 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 2208 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 1020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 4529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1020 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:33,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2227 Valid, 2162 Invalid, 4529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1020 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 02:42:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2024-10-13 02:42:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 2744. [2024-10-13 02:42:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2744 states, 1714 states have (on average 1.382147024504084) internal successors, (2369), 1718 states have internal predecessors, (2369), 973 states have call successors, (973), 56 states have call predecessors, (973), 56 states have return successors, (973), 969 states have call predecessors, (973), 973 states have call successors, (973) [2024-10-13 02:42:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 4315 transitions. [2024-10-13 02:42:33,498 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 4315 transitions. Word has length 207 [2024-10-13 02:42:33,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:33,499 INFO L471 AbstractCegarLoop]: Abstraction has 2744 states and 4315 transitions. [2024-10-13 02:42:33,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.0) internal successors, (130), 25 states have internal predecessors, (130), 8 states have call successors, (99), 4 states have call predecessors, (99), 8 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) [2024-10-13 02:42:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 4315 transitions. [2024-10-13 02:42:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 02:42:33,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:33,503 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:33,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:42:33,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:42:33,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:33,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1838894019, now seen corresponding path program 1 times [2024-10-13 02:42:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336270331] [2024-10-13 02:42:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 02:42:34,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336270331] [2024-10-13 02:42:34,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336270331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:42:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246178663] [2024-10-13 02:42:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:34,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:42:34,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:34,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:42:34,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:42:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:34,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 02:42:34,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2024-10-13 02:42:34,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:42:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 02:42:35,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246178663] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:42:35,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:42:35,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 02:42:35,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56685988] [2024-10-13 02:42:35,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:42:35,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 02:42:35,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:35,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 02:42:35,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:42:35,235 INFO L87 Difference]: Start difference. First operand 2744 states and 4315 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-10-13 02:42:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:36,276 INFO L93 Difference]: Finished difference Result 5721 states and 8801 transitions. [2024-10-13 02:42:36,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 02:42:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 207 [2024-10-13 02:42:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:36,298 INFO L225 Difference]: With dead ends: 5721 [2024-10-13 02:42:36,298 INFO L226 Difference]: Without dead ends: 3101 [2024-10-13 02:42:36,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 472 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-10-13 02:42:36,308 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 196 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:36,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 934 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:42:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2024-10-13 02:42:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2896. [2024-10-13 02:42:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2896 states, 1834 states have (on average 1.3604143947655398) internal successors, (2495), 1838 states have internal predecessors, (2495), 973 states have call successors, (973), 88 states have call predecessors, (973), 88 states have return successors, (973), 969 states have call predecessors, (973), 973 states have call successors, (973) [2024-10-13 02:42:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 4441 transitions. [2024-10-13 02:42:36,749 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 4441 transitions. Word has length 207 [2024-10-13 02:42:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:36,750 INFO L471 AbstractCegarLoop]: Abstraction has 2896 states and 4441 transitions. [2024-10-13 02:42:36,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-10-13 02:42:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 4441 transitions. [2024-10-13 02:42:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 02:42:36,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:36,754 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:36,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:42:36,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 02:42:36,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:36,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1838834437, now seen corresponding path program 1 times [2024-10-13 02:42:36,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:36,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182885614] [2024-10-13 02:42:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:36,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:42:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:42:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:42:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:42:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:42:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:42:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:42:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:42:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:42:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:42:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:42:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:42:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:42:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:42:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:42:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:42:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:42:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:42:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:42:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:42:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:42:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:42:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:42:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:42:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:42:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:42:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:42:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 02:42:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:42:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 02:42:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:42:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-13 02:42:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 02:42:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:42:37,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:42:37,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182885614] [2024-10-13 02:42:37,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182885614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:37,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:37,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:42:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203583772] [2024-10-13 02:42:37,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:37,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:42:37,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:42:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:42:37,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:42:37,170 INFO L87 Difference]: Start difference. First operand 2896 states and 4441 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:37,503 INFO L93 Difference]: Finished difference Result 5491 states and 8456 transitions. [2024-10-13 02:42:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:42:37,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2024-10-13 02:42:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:37,524 INFO L225 Difference]: With dead ends: 5491 [2024-10-13 02:42:37,525 INFO L226 Difference]: Without dead ends: 2669 [2024-10-13 02:42:37,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:42:37,535 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 138 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:37,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 282 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:42:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states. [2024-10-13 02:42:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 2667. [2024-10-13 02:42:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 1691 states have (on average 1.3648728562980486) internal successors, (2308), 1693 states have internal predecessors, (2308), 899 states have call successors, (899), 76 states have call predecessors, (899), 76 states have return successors, (899), 897 states have call predecessors, (899), 899 states have call successors, (899) [2024-10-13 02:42:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4106 transitions. [2024-10-13 02:42:37,842 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 4106 transitions. Word has length 207 [2024-10-13 02:42:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:37,843 INFO L471 AbstractCegarLoop]: Abstraction has 2667 states and 4106 transitions. [2024-10-13 02:42:37,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4106 transitions. [2024-10-13 02:42:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 02:42:37,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:37,846 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:37,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 02:42:37,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:37,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:37,847 INFO L85 PathProgramCache]: Analyzing trace with hash -165233214, now seen corresponding path program 1 times [2024-10-13 02:42:37,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:42:37,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159209759] [2024-10-13 02:42:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:37,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:42:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:42:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218839338] [2024-10-13 02:42:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:37,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:42:37,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:37,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:42:37,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 02:42:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:42:38,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:42:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:42:38,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:42:38,398 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:42:38,399 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:42:38,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:42:38,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:42:38,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:38,748 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:42:38,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:42:38 BoogieIcfgContainer [2024-10-13 02:42:38,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:42:38,753 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:42:38,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:42:38,753 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:42:38,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:10" (3/4) ... [2024-10-13 02:42:38,756 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:42:38,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:42:38,757 INFO L158 Benchmark]: Toolchain (without parser) took 29825.37ms. Allocated memory was 184.5MB in the beginning and 616.6MB in the end (delta: 432.0MB). Free memory was 128.0MB in the beginning and 531.9MB in the end (delta: -403.9MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-10-13 02:42:38,758 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 184.5MB. Free memory was 151.6MB in the beginning and 151.3MB in the end (delta: 294.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:42:38,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.34ms. Allocated memory is still 184.5MB. Free memory was 127.6MB in the beginning and 110.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:42:38,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.66ms. Allocated memory is still 184.5MB. Free memory was 110.4MB in the beginning and 105.7MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:42:38,758 INFO L158 Benchmark]: Boogie Preprocessor took 102.39ms. Allocated memory is still 184.5MB. Free memory was 105.7MB in the beginning and 99.9MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:42:38,759 INFO L158 Benchmark]: RCFGBuilder took 873.26ms. Allocated memory is still 184.5MB. Free memory was 99.9MB in the beginning and 148.6MB in the end (delta: -48.7MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2024-10-13 02:42:38,759 INFO L158 Benchmark]: TraceAbstraction took 28330.45ms. Allocated memory was 245.4MB in the beginning and 616.6MB in the end (delta: 371.2MB). Free memory was 211.1MB in the beginning and 531.9MB in the end (delta: -320.8MB). Peak memory consumption was 368.1MB. Max. memory is 16.1GB. [2024-10-13 02:42:38,760 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 616.6MB. Free memory is still 531.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:42:38,761 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 184.5MB. Free memory was 151.6MB in the beginning and 151.3MB in the end (delta: 294.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.34ms. Allocated memory is still 184.5MB. Free memory was 127.6MB in the beginning and 110.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.66ms. Allocated memory is still 184.5MB. Free memory was 110.4MB in the beginning and 105.7MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.39ms. Allocated memory is still 184.5MB. Free memory was 105.7MB in the beginning and 99.9MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 873.26ms. Allocated memory is still 184.5MB. Free memory was 99.9MB in the beginning and 148.6MB in the end (delta: -48.7MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28330.45ms. Allocated memory was 245.4MB in the beginning and 616.6MB in the end (delta: 371.2MB). Free memory was 211.1MB in the beginning and 531.9MB in the end (delta: -320.8MB). Peak memory consumption was 368.1MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 616.6MB. Free memory is still 531.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of someBinaryArithmeticDOUBLEoperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] signed char var_1_29 = 10; [L44] double var_1_30 = 0.5; [L45] unsigned char var_1_34 = 2; [L46] unsigned char var_1_35 = 4; [L47] signed long int var_1_36 = -256; [L48] unsigned short int var_1_37 = 64; [L49] unsigned short int var_1_38 = 57633; [L50] unsigned short int var_1_39 = 28505; [L51] signed short int var_1_40 = 64; [L52] signed char var_1_41 = -100; [L53] unsigned short int var_1_42 = 5; [L54] signed char var_1_43 = 100; [L55] unsigned short int last_1_var_1_6 = 4; [L56] unsigned short int last_1_var_1_9 = 4; [L57] unsigned long int last_1_var_1_14 = 500; [L58] signed short int last_1_var_1_17 = 16; [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L196] last_1_var_1_6 = var_1_6 [L197] last_1_var_1_9 = var_1_9 [L198] last_1_var_1_14 = var_1_14 [L199] last_1_var_1_17 = var_1_17 [L209] RET updateLastVariables() [L210] CALL updateVariables() [L144] var_1_4 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L145] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] var_1_5 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L148] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] var_1_10 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] var_1_12 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] var_1_13 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] var_1_15 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_16 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] var_1_19 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] var_1_20 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] var_1_21 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] var_1_22 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] var_1_24 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L178] var_1_29 = __VERIFIER_nondet_char() [L179] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L179] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L180] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L180] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L181] var_1_35 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L182] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L183] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L183] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L184] var_1_38 = __VERIFIER_nondet_ushort() [L185] CALL assume_abort_if_not(var_1_38 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L185] RET assume_abort_if_not(var_1_38 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L186] CALL assume_abort_if_not(var_1_38 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L186] RET assume_abort_if_not(var_1_38 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L187] var_1_39 = __VERIFIER_nondet_ushort() [L188] CALL assume_abort_if_not(var_1_39 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L188] RET assume_abort_if_not(var_1_39 >= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] CALL assume_abort_if_not(var_1_39 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] RET assume_abort_if_not(var_1_39 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] var_1_41 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_41 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L191] RET assume_abort_if_not(var_1_41 >= -128) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] CALL assume_abort_if_not(var_1_41 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] RET assume_abort_if_not(var_1_41 <= 127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] CALL assume_abort_if_not(var_1_41 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] RET assume_abort_if_not(var_1_41 != 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-1, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L210] RET updateVariables() [L211] CALL step() [L62] var_1_23 = var_1_24 [L63] var_1_25 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] COND TRUE (- var_1_12) >= var_1_12 [L65] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L67] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] COND TRUE var_1_14 < var_1_24 [L73] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L75] COND TRUE var_1_14 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) [L76] var_1_36 = (((((var_1_14 - var_1_20)) < ((((((var_1_24 + var_1_6)) < (var_1_6)) ? ((var_1_24 + var_1_6)) : (var_1_6))))) ? ((var_1_14 - var_1_20)) : ((((((var_1_24 + var_1_6)) < (var_1_6)) ? ((var_1_24 + var_1_6)) : (var_1_6)))))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] COND TRUE (var_1_21 * (var_1_38 - var_1_16)) <= var_1_21 [L79] var_1_37 = ((var_1_39 - var_1_35) + var_1_16) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L85] EXPR var_1_17 ^ (var_1_9 % var_1_41) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L85] COND FALSE !(var_1_24 >= (var_1_17 ^ (var_1_9 % var_1_41))) [L94] var_1_40 = var_1_19 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L96] var_1_42 = var_1_39 [L97] var_1_43 = var_1_24 [L98] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] COND TRUE last_1_var_1_14 >= stepLocal_3 [L106] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] COND TRUE (- var_1_14) > var_1_6 [L110] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] unsigned char stepLocal_2 = var_1_4; [L116] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L117] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] COND TRUE stepLocal_1 >= var_1_6 [L121] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L126] unsigned char stepLocal_5 = var_1_1; [L127] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L128] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L135] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L136] COND TRUE ! var_1_1 [L137] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L211] RET step() [L212] CALL, EXPR property() [L202-L203] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=2147483647, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_22=-16383, var_1_23=-1, var_1_24=-1, var_1_25=16, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=256, var_1_35=256, var_1_36=3, var_1_37=3221241853, var_1_38=32767, var_1_39=16383, var_1_40=-16383, var_1_41=-4, var_1_42=16383, var_1_43=-1, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 10, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3352 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3301 mSDsluCounter, 5819 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4263 mSDsCounter, 1155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5106 IncrementalHoareTripleChecker+Invalid, 6261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1155 mSolverCounterUnsat, 1556 mSDtfsCounter, 5106 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1620 GetRequests, 1465 SyntacticMatches, 3 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4319 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2896occurred in iteration=8, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 919 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 2685 NumberOfCodeBlocks, 2685 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2670 ConstructedInterpolants, 0 QuantifiedInterpolants, 12387 SizeOfPredicates, 13 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 26826/27456 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:42:38,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dda421c3cead3fdeb93df5956242977bad12a82dded40844f224149d1433f67d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:42:40,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:42:41,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:42:41,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:42:41,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:42:41,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:42:41,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:42:41,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:42:41,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:42:41,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:42:41,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:42:41,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:42:41,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:42:41,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:42:41,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:42:41,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:42:41,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:42:41,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:42:41,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:42:41,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:42:41,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:42:41,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:42:41,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:42:41,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:42:41,119 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:42:41,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:42:41,120 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:42:41,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:42:41,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:42:41,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:42:41,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:42:41,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:42:41,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:42:41,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:42:41,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:42:41,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:42:41,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:42:41,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:42:41,130 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:42:41,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:42:41,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:42:41,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:42:41,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:42:41,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:42:41,132 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:42:41,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dda421c3cead3fdeb93df5956242977bad12a82dded40844f224149d1433f67d [2024-10-13 02:42:41,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:42:41,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:42:41,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:42:41,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:42:41,506 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:42:41,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i [2024-10-13 02:42:43,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:42:43,869 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:42:43,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i [2024-10-13 02:42:43,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed48f3d1/78f8163025d94d1e900c049253fde4ab/FLAGeaceea09f [2024-10-13 02:42:44,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed48f3d1/78f8163025d94d1e900c049253fde4ab [2024-10-13 02:42:44,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:42:44,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:42:44,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:42:44,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:42:44,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:42:44,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be4799a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44, skipping insertion in model container [2024-10-13 02:42:44,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:42:44,436 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i[918,931] [2024-10-13 02:42:44,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:42:44,562 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:42:44,575 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i[918,931] [2024-10-13 02:42:44,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:42:44,640 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:42:44,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44 WrapperNode [2024-10-13 02:42:44,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:42:44,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:42:44,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:42:44,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:42:44,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,710 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-13 02:42:44,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:42:44,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:42:44,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:42:44,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:42:44,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,753 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:42:44,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:42:44,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:42:44,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:42:44,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:42:44,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (1/1) ... [2024-10-13 02:42:44,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:42:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:42:44,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:42:44,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:42:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:42:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:42:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:42:44,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:42:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:42:44,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:42:45,003 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:42:45,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:42:45,769 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:42:45,769 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:42:45,825 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:42:45,829 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:42:45,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:45 BoogieIcfgContainer [2024-10-13 02:42:45,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:42:45,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:42:45,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:42:45,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:42:45,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:42:44" (1/3) ... [2024-10-13 02:42:45,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150ed30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:42:45, skipping insertion in model container [2024-10-13 02:42:45,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:42:44" (2/3) ... [2024-10-13 02:42:45,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150ed30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:42:45, skipping insertion in model container [2024-10-13 02:42:45,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:42:45" (3/3) ... [2024-10-13 02:42:45,845 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-4.i [2024-10-13 02:42:45,862 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:42:45,863 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:42:45,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:42:45,952 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@194b9abc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:42:45,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:42:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:42:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-13 02:42:45,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:45,981 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:45,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:45,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash -794984182, now seen corresponding path program 1 times [2024-10-13 02:42:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:42:46,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790874093] [2024-10-13 02:42:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:46,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:42:46,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:42:46,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:42:46,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:42:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:46,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:42:46,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-10-13 02:42:46,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:42:46,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:42:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790874093] [2024-10-13 02:42:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790874093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:46,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:46,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:42:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558974814] [2024-10-13 02:42:46,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:46,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:42:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:42:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:42:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:42:46,475 INFO L87 Difference]: Start difference. First operand has 89 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:42:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:46,670 INFO L93 Difference]: Finished difference Result 175 states and 323 transitions. [2024-10-13 02:42:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:42:46,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2024-10-13 02:42:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:46,696 INFO L225 Difference]: With dead ends: 175 [2024-10-13 02:42:46,696 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 02:42:46,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:42:46,706 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:46,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:42:46,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 02:42:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 02:42:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:42:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 140 transitions. [2024-10-13 02:42:46,768 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 140 transitions. Word has length 203 [2024-10-13 02:42:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:46,769 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 140 transitions. [2024-10-13 02:42:46,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:42:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 140 transitions. [2024-10-13 02:42:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 02:42:46,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:46,776 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:46,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:42:46,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:42:46,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:46,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1557431874, now seen corresponding path program 1 times [2024-10-13 02:42:46,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:42:46,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713041416] [2024-10-13 02:42:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:46,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:42:46,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:42:46,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:42:46,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:42:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:47,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 02:42:47,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 309 proven. 177 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-10-13 02:42:48,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:42:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 9 proven. 180 refuted. 0 times theorem prover too weak. 1923 trivial. 0 not checked. [2024-10-13 02:42:49,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:42:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713041416] [2024-10-13 02:42:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713041416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:42:49,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:42:49,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-13 02:42:49,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543798747] [2024-10-13 02:42:49,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:42:49,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 02:42:49,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:42:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 02:42:49,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:42:49,241 INFO L87 Difference]: Start difference. First operand 87 states and 140 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-10-13 02:42:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:50,529 INFO L93 Difference]: Finished difference Result 196 states and 300 transitions. [2024-10-13 02:42:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 02:42:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 204 [2024-10-13 02:42:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:50,535 INFO L225 Difference]: With dead ends: 196 [2024-10-13 02:42:50,535 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 02:42:50,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 393 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-10-13 02:42:50,541 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 148 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:50,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 373 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 02:42:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 02:42:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2024-10-13 02:42:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:42:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2024-10-13 02:42:50,564 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 204 [2024-10-13 02:42:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:50,565 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2024-10-13 02:42:50,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-10-13 02:42:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2024-10-13 02:42:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-13 02:42:50,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:50,569 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:50,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 02:42:50,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:42:50,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:50,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2041654348, now seen corresponding path program 1 times [2024-10-13 02:42:50,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:42:50,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878429683] [2024-10-13 02:42:50,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:42:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:42:50,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:42:50,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:42:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:50,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:42:50,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:42:51,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:42:51,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:42:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878429683] [2024-10-13 02:42:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878429683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:42:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:42:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:42:51,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136823882] [2024-10-13 02:42:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:42:51,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:42:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:42:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:42:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:42:51,454 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:42:52,294 INFO L93 Difference]: Finished difference Result 285 states and 417 transitions. [2024-10-13 02:42:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:42:52,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-13 02:42:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:42:52,298 INFO L225 Difference]: With dead ends: 285 [2024-10-13 02:42:52,298 INFO L226 Difference]: Without dead ends: 188 [2024-10-13 02:42:52,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:42:52,300 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 163 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:42:52,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 359 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 02:42:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-13 02:42:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-10-13 02:42:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 113 states have internal predecessors, (139), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:42:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 271 transitions. [2024-10-13 02:42:52,341 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 271 transitions. Word has length 205 [2024-10-13 02:42:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:42:52,344 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 271 transitions. [2024-10-13 02:42:52,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:42:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 271 transitions. [2024-10-13 02:42:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-13 02:42:52,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:42:52,348 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:42:52,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 02:42:52,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:42:52,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:42:52,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:42:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1232307722, now seen corresponding path program 1 times [2024-10-13 02:42:52,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:42:52,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985066127] [2024-10-13 02:42:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:42:52,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:42:52,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:42:52,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:42:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:52,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 02:42:52,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2024-10-13 02:42:54,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:42:54,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:42:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985066127] [2024-10-13 02:42:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985066127] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:42:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [736422869] [2024-10-13 02:42:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:42:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 02:42:54,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 02:42:54,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 02:42:54,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-13 02:42:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:42:55,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 02:42:55,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:42:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 932 proven. 135 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2024-10-13 02:42:56,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:42:57,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [736422869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:42:57,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:42:57,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-10-13 02:42:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710677469] [2024-10-13 02:42:57,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:42:57,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 02:42:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:42:57,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 02:42:57,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-13 02:42:57,231 INFO L87 Difference]: Start difference. First operand 186 states and 271 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-10-13 02:43:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:01,520 INFO L93 Difference]: Finished difference Result 504 states and 711 transitions. [2024-10-13 02:43:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 02:43:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) Word has length 205 [2024-10-13 02:43:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:01,525 INFO L225 Difference]: With dead ends: 504 [2024-10-13 02:43:01,525 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 02:43:01,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 02:43:01,527 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 311 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:01,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 744 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 02:43:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 02:43:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 299. [2024-10-13 02:43:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 184 states have (on average 1.1793478260869565) internal successors, (217), 184 states have internal predecessors, (217), 99 states have call successors, (99), 15 states have call predecessors, (99), 15 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-13 02:43:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 415 transitions. [2024-10-13 02:43:01,586 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 415 transitions. Word has length 205 [2024-10-13 02:43:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:01,587 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 415 transitions. [2024-10-13 02:43:01,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 5 states have call successors, (66), 5 states have call predecessors, (66), 8 states have return successors, (66), 5 states have call predecessors, (66), 5 states have call successors, (66) [2024-10-13 02:43:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 415 transitions. [2024-10-13 02:43:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-13 02:43:01,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:01,590 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:01,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 02:43:01,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-13 02:43:01,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 02:43:01,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:01,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1490473160, now seen corresponding path program 1 times [2024-10-13 02:43:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:43:01,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829172718] [2024-10-13 02:43:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:01,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:43:01,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:43:01,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:43:01,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 02:43:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:02,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:43:02,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:43:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:43:02,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:43:02,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:43:02,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829172718] [2024-10-13 02:43:02,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829172718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:02,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:02,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:43:02,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428895761] [2024-10-13 02:43:02,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:02,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:43:02,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:43:02,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:43:02,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:43:02,969 INFO L87 Difference]: Start difference. First operand 299 states and 415 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:43:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:03,753 INFO L93 Difference]: Finished difference Result 498 states and 688 transitions. [2024-10-13 02:43:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:43:03,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-13 02:43:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:03,772 INFO L225 Difference]: With dead ends: 498 [2024-10-13 02:43:03,772 INFO L226 Difference]: Without dead ends: 200 [2024-10-13 02:43:03,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:43:03,774 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 67 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:03,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 375 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 02:43:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-13 02:43:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 185. [2024-10-13 02:43:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 108 states have internal predecessors, (123), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:43:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 255 transitions. [2024-10-13 02:43:03,816 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 255 transitions. Word has length 205 [2024-10-13 02:43:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:03,817 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 255 transitions. [2024-10-13 02:43:03,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:43:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 255 transitions. [2024-10-13 02:43:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 02:43:03,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:03,820 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:03,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 02:43:04,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:43:04,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash -36317021, now seen corresponding path program 1 times [2024-10-13 02:43:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:43:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397205555] [2024-10-13 02:43:04,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:04,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:43:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:43:04,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:43:04,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 02:43:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:04,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:43:04,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:43:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 728 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2024-10-13 02:43:04,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:43:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 18 proven. 78 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 02:43:05,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:43:05,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397205555] [2024-10-13 02:43:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397205555] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:43:05,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:43:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-13 02:43:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568095550] [2024-10-13 02:43:05,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:43:05,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 02:43:05,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:43:05,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 02:43:05,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:43:05,477 INFO L87 Difference]: Start difference. First operand 185 states and 255 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2024-10-13 02:43:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:06,125 INFO L93 Difference]: Finished difference Result 317 states and 426 transitions. [2024-10-13 02:43:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:43:06,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) Word has length 206 [2024-10-13 02:43:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:06,143 INFO L225 Difference]: With dead ends: 317 [2024-10-13 02:43:06,147 INFO L226 Difference]: Without dead ends: 205 [2024-10-13 02:43:06,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-10-13 02:43:06,148 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:06,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 183 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:43:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-13 02:43:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2024-10-13 02:43:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 114 states have internal predecessors, (127), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:43:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 259 transitions. [2024-10-13 02:43:06,199 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 259 transitions. Word has length 206 [2024-10-13 02:43:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:06,200 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 259 transitions. [2024-10-13 02:43:06,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2024-10-13 02:43:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 259 transitions. [2024-10-13 02:43:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 02:43:06,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:06,203 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:06,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 02:43:06,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:43:06,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:06,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash 182537697, now seen corresponding path program 1 times [2024-10-13 02:43:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:43:06,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978256223] [2024-10-13 02:43:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:06,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:43:06,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:43:06,408 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:43:06,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 02:43:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:06,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 02:43:06,606 INFO L278 TraceCheckSpWp]: Computing forward predicates...