./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_fillercodesize_ps-cn-10_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercodesize_ps-cn-10_file-61.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 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:16:26,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:16:26,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:16:26,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:16:26,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:16:26,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:16:26,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:16:26,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:16:26,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:16:26,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:16:26,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:16:26,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:16:26,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:16:26,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:16:26,461 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:16:26,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:16:26,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:16:26,461 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:16:26,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:16:26,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:16:26,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:16:26,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:16:26,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:16:26,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:16:26,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:16:26,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:16:26,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:16:26,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:16:26,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:16:26,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:16:26,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:16:26,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:16:26,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:16:26,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:16:26,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:16:26,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:16:26,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:16:26,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:16:26,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:16:26,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:16:26,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:16:26,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:16:26,467 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 -> 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a [2024-10-14 08:16:26,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:16:26,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:16:26,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:16:26,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:16:26,698 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:16:26,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-10-14 08:16:27,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:16:28,082 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:16:28,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-10-14 08:16:28,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cbfda9a/00fd340c65144d31a39fdf2e435baa2b/FLAG216408995 [2024-10-14 08:16:28,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cbfda9a/00fd340c65144d31a39fdf2e435baa2b [2024-10-14 08:16:28,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:16:28,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:16:28,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:16:28,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:16:28,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:16:28,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cea0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28, skipping insertion in model container [2024-10-14 08:16:28,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:16:28,637 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_fillercodesize_ps-cn-10_file-61.i[915,928] [2024-10-14 08:16:28,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:16:28,714 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:16:28,723 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_fillercodesize_ps-cn-10_file-61.i[915,928] [2024-10-14 08:16:28,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:16:28,764 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:16:28,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28 WrapperNode [2024-10-14 08:16:28,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:16:28,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:16:28,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:16:28,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:16:28,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,835 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-10-14 08:16:28,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:16:28,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:16:28,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:16:28,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:16:28,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,875 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-14 08:16:28,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:16:28,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:16:28,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:16:28,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:16:28,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (1/1) ... [2024-10-14 08:16:28,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:16:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:16:28,937 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-14 08:16:28,939 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-14 08:16:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:16:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:16:28,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:16:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:16:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:16:28,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:16:29,048 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:16:29,050 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:16:29,342 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 08:16:29,342 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:16:29,373 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:16:29,374 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:16:29,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:29 BoogieIcfgContainer [2024-10-14 08:16:29,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:16:29,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:16:29,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:16:29,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:16:29,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:16:28" (1/3) ... [2024-10-14 08:16:29,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d789a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:16:29, skipping insertion in model container [2024-10-14 08:16:29,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:28" (2/3) ... [2024-10-14 08:16:29,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d789a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:16:29, skipping insertion in model container [2024-10-14 08:16:29,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:29" (3/3) ... [2024-10-14 08:16:29,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-10-14 08:16:29,394 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:16:29,394 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:16:29,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:16:29,440 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;@7d11c856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:16:29,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:16:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 08:16:29,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:29,453 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:29,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:29,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1448648477, now seen corresponding path program 1 times [2024-10-14 08:16:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:16:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404758662] [2024-10-14 08:16:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:16:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:16:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:16:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:16:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:16:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:16:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:16:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:16:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:16:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:16:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:16:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:16:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:16:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:16:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:16:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:16:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:16:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:16:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:16:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:16:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:16:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:16:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:16:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:16:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:16:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:16:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:16:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:16:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:16:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:16:29,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:16:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404758662] [2024-10-14 08:16:29,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404758662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:16:29,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:16:29,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:16:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231681624] [2024-10-14 08:16:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:16:29,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:16:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:16:29,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:16:29,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:16:29,824 INFO L87 Difference]: Start difference. First operand has 92 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 08:16:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:29,855 INFO L93 Difference]: Finished difference Result 181 states and 318 transitions. [2024-10-14 08:16:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:16:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2024-10-14 08:16:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:29,863 INFO L225 Difference]: With dead ends: 181 [2024-10-14 08:16:29,863 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 08:16:29,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-14 08:16:29,869 INFO L432 NwaCegarLoop]: 136 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, 136 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-14 08:16:29,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:16:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 08:16:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 08:16:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2024-10-14 08:16:29,916 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 177 [2024-10-14 08:16:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:29,917 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2024-10-14 08:16:29,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 08:16:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2024-10-14 08:16:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 08:16:29,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:29,920 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:29,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:16:29,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:29,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1520312675, now seen corresponding path program 1 times [2024-10-14 08:16:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:16:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578483517] [2024-10-14 08:16:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:16:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:16:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:16:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:16:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:16:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:16:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:16:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:16:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:16:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:16:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:16:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:16:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:16:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:16:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:16:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:16:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:16:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:16:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:16:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:16:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:16:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:16:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:16:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:16:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:16:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:16:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:16:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:16:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:16:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:16:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:16:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578483517] [2024-10-14 08:16:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578483517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:16:30,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:16:30,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:16:30,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556478327] [2024-10-14 08:16:30,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:16:30,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:16:30,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:16:30,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:16:30,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:16:30,271 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:30,306 INFO L93 Difference]: Finished difference Result 179 states and 277 transitions. [2024-10-14 08:16:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:16:30,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-14 08:16:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:30,309 INFO L225 Difference]: With dead ends: 179 [2024-10-14 08:16:30,311 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 08:16:30,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-14 08:16:30,314 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:30,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:16:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 08:16:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 08:16:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2024-10-14 08:16:30,329 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 138 transitions. Word has length 177 [2024-10-14 08:16:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:30,330 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-10-14 08:16:30,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 138 transitions. [2024-10-14 08:16:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 08:16:30,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:30,332 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:30,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:16:30,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:30,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:30,333 INFO L85 PathProgramCache]: Analyzing trace with hash 780509915, now seen corresponding path program 1 times [2024-10-14 08:16:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:16:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752776643] [2024-10-14 08:16:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:16:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:16:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:16:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:16:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:16:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:16:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:16:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:16:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:16:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:16:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:16:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:16:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:16:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:16:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:16:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:16:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:16:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:16:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:16:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:16:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:16:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:16:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:16:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:16:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:16:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:16:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:16:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:16:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:16:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:16:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:16:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752776643] [2024-10-14 08:16:30,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752776643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:16:30,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:16:30,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:16:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625487078] [2024-10-14 08:16:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:16:30,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:16:30,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:16:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:16:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:16:30,814 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:30,981 INFO L93 Difference]: Finished difference Result 179 states and 275 transitions. [2024-10-14 08:16:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:16:30,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-14 08:16:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:30,988 INFO L225 Difference]: With dead ends: 179 [2024-10-14 08:16:30,988 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 08:16:30,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-14 08:16:30,992 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 87 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:30,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 202 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 08:16:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 08:16:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 08:16:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 137 transitions. [2024-10-14 08:16:31,009 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 137 transitions. Word has length 177 [2024-10-14 08:16:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:31,010 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 137 transitions. [2024-10-14 08:16:31,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 137 transitions. [2024-10-14 08:16:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 08:16:31,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:31,015 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:16:31,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:31,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash -230607335, now seen corresponding path program 1 times [2024-10-14 08:16:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:16:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642203894] [2024-10-14 08:16:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:16:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:16:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:16:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:16:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:16:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:16:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:16:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:16:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:16:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:16:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:16:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:16:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:16:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:16:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:16:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:16:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:16:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:16:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:16:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:16:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:16:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:16:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:16:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:16:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:16:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:16:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:16:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:16:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:16:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:16:31,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:16:31,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642203894] [2024-10-14 08:16:31,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642203894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:16:31,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:16:31,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 08:16:31,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450312866] [2024-10-14 08:16:31,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:16:31,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 08:16:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:16:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 08:16:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:16:31,424 INFO L87 Difference]: Start difference. First operand 90 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:31,754 INFO L93 Difference]: Finished difference Result 267 states and 407 transitions. [2024-10-14 08:16:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:16:31,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-14 08:16:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:31,756 INFO L225 Difference]: With dead ends: 267 [2024-10-14 08:16:31,756 INFO L226 Difference]: Without dead ends: 178 [2024-10-14 08:16:31,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 08:16:31,760 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 166 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:31,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 297 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 08:16:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-14 08:16:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 114. [2024-10-14 08:16:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2024-10-14 08:16:31,791 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 177 [2024-10-14 08:16:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:31,792 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2024-10-14 08:16:31,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2024-10-14 08:16:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 08:16:31,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:31,793 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:31,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 08:16:31,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:31,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1251675689, now seen corresponding path program 1 times [2024-10-14 08:16:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:16:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16139354] [2024-10-14 08:16:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:16:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:16:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:16:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:16:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:16:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:16:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:16:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:16:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:16:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:16:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:16:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:16:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:16:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:16:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:16:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:16:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:16:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:16:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:16:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:16:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:16:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:16:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:16:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:16:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:16:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:16:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:16:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:16:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:16:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:16:31,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:16:31,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16139354] [2024-10-14 08:16:31,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16139354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:16:31,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:16:31,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:16:31,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261657928] [2024-10-14 08:16:31,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:16:31,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:16:31,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:16:31,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:16:31,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:16:31,981 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:32,099 INFO L93 Difference]: Finished difference Result 291 states and 438 transitions. [2024-10-14 08:16:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:16:32,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-14 08:16:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:32,101 INFO L225 Difference]: With dead ends: 291 [2024-10-14 08:16:32,101 INFO L226 Difference]: Without dead ends: 178 [2024-10-14 08:16:32,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-14 08:16:32,102 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 122 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:32,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 358 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 08:16:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-14 08:16:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 114. [2024-10-14 08:16:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2024-10-14 08:16:32,133 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 177 [2024-10-14 08:16:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:32,135 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2024-10-14 08:16:32,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2024-10-14 08:16:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 08:16:32,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:32,137 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:32,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 08:16:32,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:32,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1327112073, now seen corresponding path program 1 times [2024-10-14 08:16:32,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:16:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034448293] [2024-10-14 08:16:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:16:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 08:16:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687283095] [2024-10-14 08:16:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:32,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:16:32,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:16:32,264 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-14 08:16:32,266 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-14 08:16:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:32,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 08:16:32,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:16:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 723 proven. 129 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2024-10-14 08:16:33,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:16:35,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:16:35,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034448293] [2024-10-14 08:16:35,537 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 08:16:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687283095] [2024-10-14 08:16:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687283095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:16:35,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 08:16:35,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-14 08:16:35,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290594878] [2024-10-14 08:16:35,538 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 08:16:35,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 08:16:35,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:16:35,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 08:16:35,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=136, Unknown=7, NotChecked=0, Total=182 [2024-10-14 08:16:35,540 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2024-10-14 08:16:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:37,066 INFO L93 Difference]: Finished difference Result 243 states and 352 transitions. [2024-10-14 08:16:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 08:16:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 179 [2024-10-14 08:16:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:37,068 INFO L225 Difference]: With dead ends: 243 [2024-10-14 08:16:37,068 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 08:16:37,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=365, Unknown=7, NotChecked=0, Total=506 [2024-10-14 08:16:37,069 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 73 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:37,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 418 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 257 Invalid, 60 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 08:16:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 08:16:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2024-10-14 08:16:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2024-10-14 08:16:37,091 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 179 [2024-10-14 08:16:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:37,091 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2024-10-14 08:16:37,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2024-10-14 08:16:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2024-10-14 08:16:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 08:16:37,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:37,093 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:37,107 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-14 08:16:37,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 08:16:37,294 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:37,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1619305675, now seen corresponding path program 1 times [2024-10-14 08:16:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:16:37,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776048689] [2024-10-14 08:16:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:37,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:16:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:16:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:16:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:16:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:16:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:16:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:16:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:16:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:16:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:16:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:16:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:16:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:16:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:16:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:16:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:16:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:16:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:16:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:16:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:16:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:16:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:16:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:16:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:16:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:16:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:16:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:16:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:16:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:16:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-14 08:16:37,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:16:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776048689] [2024-10-14 08:16:37,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776048689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:16:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849087267] [2024-10-14 08:16:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:37,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:16:37,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:16:37,747 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-14 08:16:37,748 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-14 08:16:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:37,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 08:16:37,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:16:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 797 proven. 78 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-10-14 08:16:38,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:16:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-14 08:16:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849087267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 08:16:38,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 08:16:38,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-14 08:16:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814170390] [2024-10-14 08:16:38,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 08:16:38,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 08:16:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:16:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 08:16:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 08:16:38,419 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-10-14 08:16:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:39,476 INFO L93 Difference]: Finished difference Result 556 states and 760 transitions. [2024-10-14 08:16:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-14 08:16:39,477 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 179 [2024-10-14 08:16:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:39,479 INFO L225 Difference]: With dead ends: 556 [2024-10-14 08:16:39,479 INFO L226 Difference]: Without dead ends: 433 [2024-10-14 08:16:39,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 408 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 08:16:39,481 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 460 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:39,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 659 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 08:16:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-14 08:16:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 138. [2024-10-14 08:16:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 103 states have internal predecessors, (130), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 186 transitions. [2024-10-14 08:16:39,517 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 186 transitions. Word has length 179 [2024-10-14 08:16:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:39,517 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 186 transitions. [2024-10-14 08:16:39,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-10-14 08:16:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 186 transitions. [2024-10-14 08:16:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 08:16:39,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:39,518 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:39,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 08:16:39,722 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,SelfDestructingSolverStorable6 [2024-10-14 08:16:39,723 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:39,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash -809959049, now seen corresponding path program 1 times [2024-10-14 08:16:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:16:39,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084767915] [2024-10-14 08:16:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:16:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 08:16:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194220672] [2024-10-14 08:16:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:39,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:16:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:16:39,796 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-14 08:16:39,796 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-14 08:16:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:16:39,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 08:16:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:16:39,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 08:16:39,999 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 08:16:40,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 08:16:40,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 08:16:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:16:40,205 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:16:40,291 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 08:16:40,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:16:40 BoogieIcfgContainer [2024-10-14 08:16:40,294 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 08:16:40,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 08:16:40,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 08:16:40,294 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 08:16:40,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:29" (3/4) ... [2024-10-14 08:16:40,296 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 08:16:40,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 08:16:40,298 INFO L158 Benchmark]: Toolchain (without parser) took 11813.95ms. Allocated memory was 176.2MB in the beginning and 331.4MB in the end (delta: 155.2MB). Free memory was 108.7MB in the beginning and 232.2MB in the end (delta: -123.5MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-10-14 08:16:40,298 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 107.0MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:16:40,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.79ms. Allocated memory is still 176.2MB. Free memory was 108.6MB in the beginning and 93.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 08:16:40,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.96ms. Allocated memory is still 176.2MB. Free memory was 93.6MB in the beginning and 148.9MB in the end (delta: -55.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-14 08:16:40,299 INFO L158 Benchmark]: Boogie Preprocessor took 63.64ms. Allocated memory is still 176.2MB. Free memory was 148.9MB in the beginning and 144.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:16:40,299 INFO L158 Benchmark]: RCFGBuilder took 473.51ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 114.7MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 08:16:40,299 INFO L158 Benchmark]: TraceAbstraction took 10917.27ms. Allocated memory was 176.2MB in the beginning and 331.4MB in the end (delta: 155.2MB). Free memory was 114.0MB in the beginning and 232.2MB in the end (delta: -118.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-10-14 08:16:40,299 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 331.4MB. Free memory is still 232.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:16:40,300 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.12ms. Allocated memory is still 107.0MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.79ms. Allocated memory is still 176.2MB. Free memory was 108.6MB in the beginning and 93.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.96ms. Allocated memory is still 176.2MB. Free memory was 93.6MB in the beginning and 148.9MB in the end (delta: -55.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.64ms. Allocated memory is still 176.2MB. Free memory was 148.9MB in the beginning and 144.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 473.51ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 114.7MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10917.27ms. Allocated memory was 176.2MB in the beginning and 331.4MB in the end (delta: 155.2MB). Free memory was 114.0MB in the beginning and 232.2MB in the end (delta: -118.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 331.4MB. Free memory is still 232.2MB. 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 someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 161. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_25 = 2; [L42] unsigned long int var_1_26 = 1; [L43] unsigned short int var_1_27 = 256; [L44] unsigned short int var_1_28 = 10; [L45] unsigned short int var_1_29 = 16; [L46] signed long int var_1_30 = -16; [L47] unsigned char var_1_31 = 0; [L48] unsigned char var_1_32 = 32; [L49] unsigned char var_1_33 = 5; [L50] signed long int last_1_var_1_9 = -50; [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L158] last_1_var_1_9 = var_1_9 [L168] RET updateLastVariables() [L169] CALL updateVariables() [L114] var_1_5 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L115] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L116] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L116] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L117] var_1_6 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L118] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L119] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L119] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L120] var_1_8 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L121] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L122] var_1_14 = __VERIFIER_nondet_ulong() [L123] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L123] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L124] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L124] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L125] var_1_15 = __VERIFIER_nondet_ulong() [L126] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L126] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L127] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L127] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L128] var_1_16 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L130] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L130] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L131] var_1_17 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L132] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L133] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L133] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L134] var_1_18 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L135] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L136] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L136] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L137] var_1_20 = __VERIFIER_nondet_ushort() [L138] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L138] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L139] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L139] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L140] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L140] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L141] var_1_23 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L142] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L143] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L143] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L144] var_1_25 = __VERIFIER_nondet_ulong() [L145] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L146] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L146] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L147] var_1_28 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L149] CALL assume_abort_if_not(var_1_28 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L149] RET assume_abort_if_not(var_1_28 <= 65534) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] var_1_31 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] var_1_33 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET updateVariables() [L170] CALL step() [L54] var_1_24 = var_1_25 [L55] var_1_26 = var_1_25 [L56] var_1_27 = var_1_28 [L57] var_1_29 = var_1_28 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L58] EXPR var_1_29 & var_1_27 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L58] COND FALSE !(var_1_24 <= (var_1_29 & var_1_27)) [L63] var_1_32 = var_1_33 [L64] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L65] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L68] var_1_21 = var_1_6 [L69] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L73] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L74] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L77] signed long int stepLocal_3 = var_1_9; [L78] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=4294967296, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L79] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=4294967296, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L79] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L80] COND FALSE !(var_1_9 <= stepLocal_2) [L89] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L91] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L98] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L100] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=0, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L101] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L102] COND TRUE \read(var_1_13) [L103] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L170] RET step() [L171] CALL, EXPR property() [L161] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161-L162] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-3, var_1_23=-3, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=4294967296, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 60 mSolverCounterUnknown, 968 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 953 mSDsluCounter, 2335 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1353 mSDsCounter, 400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1056 IncrementalHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 400 mSolverCounterUnsat, 982 mSDtfsCounter, 1056 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 970 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=7, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 429 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1959 NumberOfCodeBlocks, 1959 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1592 ConstructedInterpolants, 1 QuantifiedInterpolants, 5569 SizeOfPredicates, 6 NumberOfNonLiveVariables, 817 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 13317/13608 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-14 08:16:40,334 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_fillercodesize_ps-cn-10_file-61.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 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:16:42,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:16:42,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 08:16:42,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:16:42,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:16:42,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:16:42,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:16:42,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:16:42,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:16:42,186 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:16:42,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:16:42,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:16:42,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:16:42,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:16:42,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:16:42,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:16:42,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:16:42,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:16:42,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:16:42,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:16:42,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:16:42,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:16:42,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:16:42,191 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 08:16:42,192 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 08:16:42,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:16:42,192 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 08:16:42,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:16:42,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:16:42,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:16:42,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:16:42,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:16:42,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:16:42,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:16:42,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:16:42,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:16:42,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:16:42,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:16:42,194 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 08:16:42,194 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 08:16:42,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:16:42,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:16:42,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:16:42,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:16:42,195 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 08:16:42,195 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 -> 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a [2024-10-14 08:16:42,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:16:42,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:16:42,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:16:42,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:16:42,446 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:16:42,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-10-14 08:16:43,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:16:43,919 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:16:43,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-10-14 08:16:43,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a9618df/66962b637ca44754b9dc28f81950a623/FLAG8842f0b14 [2024-10-14 08:16:43,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a9618df/66962b637ca44754b9dc28f81950a623 [2024-10-14 08:16:43,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:16:43,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:16:43,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:16:43,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:16:43,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:16:43,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:16:43" (1/1) ... [2024-10-14 08:16:43,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714eb5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:43, skipping insertion in model container [2024-10-14 08:16:43,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:16:43" (1/1) ... [2024-10-14 08:16:43,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:16:44,114 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_fillercodesize_ps-cn-10_file-61.i[915,928] [2024-10-14 08:16:44,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:16:44,195 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:16:44,210 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_fillercodesize_ps-cn-10_file-61.i[915,928] [2024-10-14 08:16:44,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:16:44,263 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:16:44,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44 WrapperNode [2024-10-14 08:16:44,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:16:44,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:16:44,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:16:44,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:16:44,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,312 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-10-14 08:16:44,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:16:44,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:16:44,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:16:44,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:16:44,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,347 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-14 08:16:44,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:16:44,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:16:44,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:16:44,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:16:44,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (1/1) ... [2024-10-14 08:16:44,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:16:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:16:44,411 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-14 08:16:44,413 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-14 08:16:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:16:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 08:16:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:16:44,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:16:44,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:16:44,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:16:44,532 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:16:44,534 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:16:44,990 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 08:16:44,990 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:16:45,052 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:16:45,052 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:16:45,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:45 BoogieIcfgContainer [2024-10-14 08:16:45,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:16:45,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:16:45,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:16:45,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:16:45,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:16:43" (1/3) ... [2024-10-14 08:16:45,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d61d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:16:45, skipping insertion in model container [2024-10-14 08:16:45,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:44" (2/3) ... [2024-10-14 08:16:45,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d61d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:16:45, skipping insertion in model container [2024-10-14 08:16:45,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:45" (3/3) ... [2024-10-14 08:16:45,063 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2024-10-14 08:16:45,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:16:45,077 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:16:45,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:16:45,137 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;@355a89a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:16:45,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:16:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 08:16:45,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:45,152 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:45,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:45,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1965560201, now seen corresponding path program 1 times [2024-10-14 08:16:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:16:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275276319] [2024-10-14 08:16:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:45,170 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-14 08:16:45,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:16:45,173 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-14 08:16:45,173 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-14 08:16:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:45,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 08:16:45,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:16:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-14 08:16:45,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:16:45,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:16:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275276319] [2024-10-14 08:16:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275276319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:16:45,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:16:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:16:45,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445468426] [2024-10-14 08:16:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:16:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:16:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:16:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:16:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:16:45,501 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 08:16:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:45,619 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2024-10-14 08:16:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:16:45,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2024-10-14 08:16:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:45,633 INFO L225 Difference]: With dead ends: 143 [2024-10-14 08:16:45,633 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 08:16:45,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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-14 08:16:45,638 INFO L432 NwaCegarLoop]: 108 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, 108 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:45,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 08:16:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 08:16:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-14 08:16:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2024-10-14 08:16:45,685 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 172 [2024-10-14 08:16:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:45,686 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2024-10-14 08:16:45,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 08:16:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2024-10-14 08:16:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 08:16:45,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:45,689 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:45,697 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-14 08:16:45,889 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-14 08:16:45,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:45,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash 65339127, now seen corresponding path program 1 times [2024-10-14 08:16:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:16:45,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445039489] [2024-10-14 08:16:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:45,892 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-14 08:16:45,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:16:45,893 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-14 08:16:45,894 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-14 08:16:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:46,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 08:16:46,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:16:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:16:46,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:16:46,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:16:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445039489] [2024-10-14 08:16:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445039489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:16:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:16:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:16:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662973454] [2024-10-14 08:16:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:16:46,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 08:16:46,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:16:46,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 08:16:46,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:16:46,515 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:46,924 INFO L93 Difference]: Finished difference Result 227 states and 355 transitions. [2024-10-14 08:16:46,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 08:16:46,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-14 08:16:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:46,934 INFO L225 Difference]: With dead ends: 227 [2024-10-14 08:16:46,934 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 08:16:46,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 08:16:46,936 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 85 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:46,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 389 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 08:16:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 08:16:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2024-10-14 08:16:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 08:16:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 219 transitions. [2024-10-14 08:16:46,969 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 219 transitions. Word has length 172 [2024-10-14 08:16:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:46,970 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 219 transitions. [2024-10-14 08:16:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 219 transitions. [2024-10-14 08:16:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 08:16:46,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:46,976 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:46,987 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-14 08:16:47,176 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-14 08:16:47,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:47,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash -945778123, now seen corresponding path program 1 times [2024-10-14 08:16:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:16:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585459049] [2024-10-14 08:16:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:47,178 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-14 08:16:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:16:47,181 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-14 08:16:47,182 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-14 08:16:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:47,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 08:16:47,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:16:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-14 08:16:47,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:16:47,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:16:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585459049] [2024-10-14 08:16:47,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585459049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:16:47,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:16:47,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:16:47,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556983504] [2024-10-14 08:16:47,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:16:47,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:16:47,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:16:47,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:16:47,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:16:47,629 INFO L87 Difference]: Start difference. First operand 139 states and 219 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:47,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:16:47,865 INFO L93 Difference]: Finished difference Result 141 states and 220 transitions. [2024-10-14 08:16:47,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:16:47,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-14 08:16:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:16:47,874 INFO L225 Difference]: With dead ends: 141 [2024-10-14 08:16:47,874 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 08:16:47,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:16:47,875 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 28 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:16:47,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:16:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 08:16:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-14 08:16:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 08:16:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-14 08:16:47,896 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 172 [2024-10-14 08:16:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:16:47,896 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-14 08:16:47,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-14 08:16:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-14 08:16:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 08:16:47,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:16:47,899 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:16:47,907 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-14 08:16:48,099 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-14 08:16:48,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:16:48,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:16:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1338805133, now seen corresponding path program 1 times [2024-10-14 08:16:48,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:16:48,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035444002] [2024-10-14 08:16:48,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:16:48,102 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-14 08:16:48,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:16:48,104 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-14 08:16:48,105 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-14 08:16:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:16:48,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 08:16:48,301 INFO L278 TraceCheckSpWp]: Computing forward predicates...