./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.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 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:27:02,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:27:02,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:27:02,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:27:02,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:27:02,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:27:02,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:27:02,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:27:02,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:27:02,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:27:02,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:27:02,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:27:02,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:27:02,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:27:02,258 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:27:02,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:27:02,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:27:02,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:27:02,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:27:02,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:27:02,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:27:02,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:27:02,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:27:02,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:27:02,264 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:27:02,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:27:02,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:27:02,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:27:02,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:27:02,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:27:02,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:27:02,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:27:02,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:02,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:27:02,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:27:02,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:27:02,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:27:02,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:27:02,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:27:02,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:27:02,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:27:02,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:27:02,271 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 -> 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 [2024-10-24 07:27:02,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:27:02,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:27:02,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:27:02,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:27:02,564 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:27:02,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-24 07:27:03,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:27:04,217 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:27:04,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-24 07:27:04,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed3a1b246/dca42889f14349fc854794375c2123e7/FLAG9b5741152 [2024-10-24 07:27:04,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed3a1b246/dca42889f14349fc854794375c2123e7 [2024-10-24 07:27:04,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:27:04,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:27:04,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:04,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:27:04,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:27:04,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617d273c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04, skipping insertion in model container [2024-10-24 07:27:04,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:27:04,471 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-10-24 07:27:04,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:04,562 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:27:04,577 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-10-24 07:27:04,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:04,648 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:27:04,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04 WrapperNode [2024-10-24 07:27:04,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:04,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:04,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:27:04,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:27:04,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,717 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 231 [2024-10-24 07:27:04,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:04,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:27:04,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:27:04,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:27:04,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,759 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-24 07:27:04,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:27:04,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:27:04,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:27:04,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:27:04,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (1/1) ... [2024-10-24 07:27:04,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:04,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:04,841 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-24 07:27:04,844 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-24 07:27:04,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:27:04,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:27:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:27:04,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:27:04,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:27:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:27:05,004 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:27:05,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:27:05,444 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 07:27:05,444 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:27:05,487 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:27:05,488 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:27:05,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:05 BoogieIcfgContainer [2024-10-24 07:27:05,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:27:05,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:27:05,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:27:05,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:27:05,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:27:04" (1/3) ... [2024-10-24 07:27:05,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e382bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:05, skipping insertion in model container [2024-10-24 07:27:05,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:04" (2/3) ... [2024-10-24 07:27:05,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e382bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:05, skipping insertion in model container [2024-10-24 07:27:05,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:05" (3/3) ... [2024-10-24 07:27:05,498 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-24 07:27:05,515 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:27:05,515 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:27:05,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:27:05,585 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;@a2b1580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:27:05,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:27:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:27:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 07:27:05,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:05,602 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:05,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:05,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1615065824, now seen corresponding path program 1 times [2024-10-24 07:27:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:05,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441966428] [2024-10-24 07:27:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:27:06,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:06,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441966428] [2024-10-24 07:27:06,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441966428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:06,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:06,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:27:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013999936] [2024-10-24 07:27:06,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:27:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:06,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:27:06,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:27:06,395 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 07:27:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:06,446 INFO L93 Difference]: Finished difference Result 189 states and 338 transitions. [2024-10-24 07:27:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:27:06,450 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-10-24 07:27:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:06,459 INFO L225 Difference]: With dead ends: 189 [2024-10-24 07:27:06,460 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 07:27:06,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-24 07:27:06,468 INFO L432 NwaCegarLoop]: 145 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, 145 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-24 07:27:06,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:27:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 07:27:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 07:27:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:27:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 148 transitions. [2024-10-24 07:27:06,535 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 148 transitions. Word has length 205 [2024-10-24 07:27:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:06,536 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 148 transitions. [2024-10-24 07:27:06,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 07:27:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 148 transitions. [2024-10-24 07:27:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 07:27:06,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:06,544 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:27:06,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:06,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1940823716, now seen corresponding path program 1 times [2024-10-24 07:27:06,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:06,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647587480] [2024-10-24 07:27:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:27:06,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:06,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647587480] [2024-10-24 07:27:06,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647587480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:06,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:06,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:27:06,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523449625] [2024-10-24 07:27:06,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:06,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:27:06,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:27:06,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:27:06,951 INFO L87 Difference]: Start difference. First operand 94 states and 148 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:07,034 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2024-10-24 07:27:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:27:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-24 07:27:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:07,039 INFO L225 Difference]: With dead ends: 222 [2024-10-24 07:27:07,039 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 07:27:07,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-24 07:27:07,042 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:07,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 270 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:27:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 07:27:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-10-24 07:27:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.449438202247191) internal successors, (129), 89 states have internal predecessors, (129), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:27:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 193 transitions. [2024-10-24 07:27:07,065 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 193 transitions. Word has length 205 [2024-10-24 07:27:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:07,067 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 193 transitions. [2024-10-24 07:27:07,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 193 transitions. [2024-10-24 07:27:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-24 07:27:07,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:07,076 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:07,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:27:07,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:07,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:07,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1931441754, now seen corresponding path program 1 times [2024-10-24 07:27:07,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:07,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747454072] [2024-10-24 07:27:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:07,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:27:07,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:07,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747454072] [2024-10-24 07:27:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747454072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:07,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:07,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:27:07,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90341344] [2024-10-24 07:27:07,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:07,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:27:07,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:27:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:27:07,438 INFO L87 Difference]: Start difference. First operand 123 states and 193 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:07,525 INFO L93 Difference]: Finished difference Result 311 states and 488 transitions. [2024-10-24 07:27:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:27:07,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-24 07:27:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:07,529 INFO L225 Difference]: With dead ends: 311 [2024-10-24 07:27:07,529 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 07:27:07,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:27:07,531 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 72 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:07,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 278 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:27:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 07:27:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2024-10-24 07:27:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 140 states have (on average 1.4714285714285715) internal successors, (206), 141 states have internal predecessors, (206), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 07:27:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 292 transitions. [2024-10-24 07:27:07,554 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 292 transitions. Word has length 205 [2024-10-24 07:27:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:07,557 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 292 transitions. [2024-10-24 07:27:07,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 292 transitions. [2024-10-24 07:27:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-24 07:27:07,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:07,560 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:07,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:27:07,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:07,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:07,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1221712008, now seen corresponding path program 1 times [2024-10-24 07:27:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:07,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606042425] [2024-10-24 07:27:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 07:27:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:08,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606042425] [2024-10-24 07:27:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606042425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:27:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535440614] [2024-10-24 07:27:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:08,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:08,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:08,591 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-24 07:27:08,593 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-24 07:27:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:08,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 07:27:08,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1321 proven. 66 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2024-10-24 07:27:09,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:27:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 07:27:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535440614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:27:09,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:27:09,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-10-24 07:27:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753499527] [2024-10-24 07:27:09,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:27:09,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 07:27:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 07:27:09,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-24 07:27:09,791 INFO L87 Difference]: Start difference. First operand 186 states and 292 transitions. Second operand has 16 states, 16 states have (on average 7.625) internal successors, (122), 16 states have internal predecessors, (122), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-10-24 07:27:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:11,119 INFO L93 Difference]: Finished difference Result 590 states and 899 transitions. [2024-10-24 07:27:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 07:27:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.625) internal successors, (122), 16 states have internal predecessors, (122), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) Word has length 206 [2024-10-24 07:27:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:11,125 INFO L225 Difference]: With dead ends: 590 [2024-10-24 07:27:11,125 INFO L226 Difference]: Without dead ends: 405 [2024-10-24 07:27:11,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=1091, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 07:27:11,128 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 391 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:11,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 557 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 07:27:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-24 07:27:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 354. [2024-10-24 07:27:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 287 states have (on average 1.4634146341463414) internal successors, (420), 290 states have internal predecessors, (420), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-24 07:27:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 534 transitions. [2024-10-24 07:27:11,193 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 534 transitions. Word has length 206 [2024-10-24 07:27:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:11,194 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 534 transitions. [2024-10-24 07:27:11,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.625) internal successors, (122), 16 states have internal predecessors, (122), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-10-24 07:27:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 534 transitions. [2024-10-24 07:27:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-24 07:27:11,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:11,197 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:11,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 07:27:11,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:11,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:11,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2108995332, now seen corresponding path program 1 times [2024-10-24 07:27:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:11,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596701961] [2024-10-24 07:27:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:11,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 07:27:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596701961] [2024-10-24 07:27:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596701961] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:27:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351359598] [2024-10-24 07:27:11,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:11,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:11,938 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-24 07:27:11,942 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-24 07:27:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:12,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:27:12,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 717 proven. 72 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2024-10-24 07:27:12,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:27:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 07:27:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351359598] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:27:12,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:27:12,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-24 07:27:12,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664167979] [2024-10-24 07:27:12,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:27:12,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 07:27:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 07:27:12,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:27:12,743 INFO L87 Difference]: Start difference. First operand 354 states and 534 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2024-10-24 07:27:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:13,481 INFO L93 Difference]: Finished difference Result 766 states and 1121 transitions. [2024-10-24 07:27:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 07:27:13,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) Word has length 206 [2024-10-24 07:27:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:13,485 INFO L225 Difference]: With dead ends: 766 [2024-10-24 07:27:13,485 INFO L226 Difference]: Without dead ends: 413 [2024-10-24 07:27:13,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2024-10-24 07:27:13,488 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 203 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:13,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 444 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 07:27:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-24 07:27:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 352. [2024-10-24 07:27:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 278 states have (on average 1.39568345323741) internal successors, (388), 281 states have internal predecessors, (388), 59 states have call successors, (59), 14 states have call predecessors, (59), 14 states have return successors, (59), 56 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-24 07:27:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 506 transitions. [2024-10-24 07:27:13,528 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 506 transitions. Word has length 206 [2024-10-24 07:27:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:13,530 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 506 transitions. [2024-10-24 07:27:13,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2024-10-24 07:27:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 506 transitions. [2024-10-24 07:27:13,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-24 07:27:13,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:13,533 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:13,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:27:13,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:13,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:13,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1448109133, now seen corresponding path program 1 times [2024-10-24 07:27:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376600741] [2024-10-24 07:27:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:13,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:27:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376600741] [2024-10-24 07:27:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376600741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:14,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:14,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:27:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160308987] [2024-10-24 07:27:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:14,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:27:14,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:27:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:27:14,041 INFO L87 Difference]: Start difference. First operand 352 states and 506 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:14,379 INFO L93 Difference]: Finished difference Result 783 states and 1109 transitions. [2024-10-24 07:27:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:27:14,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-24 07:27:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:14,385 INFO L225 Difference]: With dead ends: 783 [2024-10-24 07:27:14,385 INFO L226 Difference]: Without dead ends: 432 [2024-10-24 07:27:14,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:27:14,389 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 133 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:14,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 573 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:27:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-24 07:27:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 322. [2024-10-24 07:27:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.40234375) internal successors, (359), 258 states have internal predecessors, (359), 52 states have call successors, (52), 13 states have call predecessors, (52), 13 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 07:27:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 463 transitions. [2024-10-24 07:27:14,425 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 463 transitions. Word has length 207 [2024-10-24 07:27:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:14,426 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 463 transitions. [2024-10-24 07:27:14,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 463 transitions. [2024-10-24 07:27:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-24 07:27:14,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:14,430 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:14,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 07:27:14,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:14,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash -558860417, now seen corresponding path program 1 times [2024-10-24 07:27:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:14,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462561735] [2024-10-24 07:27:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:27:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462561735] [2024-10-24 07:27:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462561735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:27:14,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703284042] [2024-10-24 07:27:14,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:14,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:27:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:27:14,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:27:14,645 INFO L87 Difference]: Start difference. First operand 322 states and 463 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:14,763 INFO L93 Difference]: Finished difference Result 692 states and 993 transitions. [2024-10-24 07:27:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:27:14,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-24 07:27:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:14,766 INFO L225 Difference]: With dead ends: 692 [2024-10-24 07:27:14,766 INFO L226 Difference]: Without dead ends: 361 [2024-10-24 07:27:14,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:27:14,769 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 55 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:14,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 250 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:27:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-24 07:27:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 281. [2024-10-24 07:27:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 226 states have (on average 1.3938053097345133) internal successors, (315), 227 states have internal predecessors, (315), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 07:27:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 401 transitions. [2024-10-24 07:27:14,798 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 401 transitions. Word has length 207 [2024-10-24 07:27:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:14,801 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 401 transitions. [2024-10-24 07:27:14,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 401 transitions. [2024-10-24 07:27:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-24 07:27:14,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:14,805 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:14,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 07:27:14,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:14,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:14,805 INFO L85 PathProgramCache]: Analyzing trace with hash 450147094, now seen corresponding path program 1 times [2024-10-24 07:27:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:14,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229397215] [2024-10-24 07:27:14,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:14,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:27:15,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:15,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229397215] [2024-10-24 07:27:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229397215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:15,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:15,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:27:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532243120] [2024-10-24 07:27:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:15,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:27:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:27:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:27:15,339 INFO L87 Difference]: Start difference. First operand 281 states and 401 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:15,487 INFO L93 Difference]: Finished difference Result 581 states and 826 transitions. [2024-10-24 07:27:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:27:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-24 07:27:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:15,490 INFO L225 Difference]: With dead ends: 581 [2024-10-24 07:27:15,490 INFO L226 Difference]: Without dead ends: 301 [2024-10-24 07:27:15,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 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-24 07:27:15,492 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 40 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:15,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 265 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:27:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-24 07:27:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 281. [2024-10-24 07:27:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 226 states have (on average 1.3893805309734513) internal successors, (314), 227 states have internal predecessors, (314), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 07:27:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 400 transitions. [2024-10-24 07:27:15,520 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 400 transitions. Word has length 207 [2024-10-24 07:27:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:15,520 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 400 transitions. [2024-10-24 07:27:15,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 400 transitions. [2024-10-24 07:27:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-24 07:27:15,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:15,524 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:15,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 07:27:15,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:15,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1952021532, now seen corresponding path program 1 times [2024-10-24 07:27:15,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:15,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314291056] [2024-10-24 07:27:15,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:27:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:27:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:27:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:27:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:27:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 07:27:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 07:27:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 07:27:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 07:27:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 07:27:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:27:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:27:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 07:27:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:27:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:27:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:27:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:27:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:27:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:27:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:27:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:27:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:27:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 07:27:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:27:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 07:27:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:27:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 07:27:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 07:27:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 07:27:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 07:27:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 07:27:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 07:27:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 07:27:15,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:27:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314291056] [2024-10-24 07:27:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314291056] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:27:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419786649] [2024-10-24 07:27:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:15,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:15,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:15,861 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-24 07:27:15,862 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-24 07:27:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:16,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:27:16,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 841 proven. 66 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2024-10-24 07:27:16,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:27:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-24 07:27:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419786649] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:27:16,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:27:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-24 07:27:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572033432] [2024-10-24 07:27:16,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:27:16,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 07:27:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:16,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 07:27:16,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:27:16,560 INFO L87 Difference]: Start difference. First operand 281 states and 400 transitions. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2024-10-24 07:27:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:17,844 INFO L93 Difference]: Finished difference Result 760 states and 1055 transitions. [2024-10-24 07:27:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-24 07:27:17,845 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) Word has length 208 [2024-10-24 07:27:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:17,849 INFO L225 Difference]: With dead ends: 760 [2024-10-24 07:27:17,849 INFO L226 Difference]: Without dead ends: 470 [2024-10-24 07:27:17,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=545, Invalid=1711, Unknown=0, NotChecked=0, Total=2256 [2024-10-24 07:27:17,853 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 589 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:17,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 445 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:27:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-24 07:27:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 292. [2024-10-24 07:27:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 238 states have internal predecessors, (330), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 07:27:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 416 transitions. [2024-10-24 07:27:17,886 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 416 transitions. Word has length 208 [2024-10-24 07:27:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:17,887 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 416 transitions. [2024-10-24 07:27:17,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2024-10-24 07:27:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 416 transitions. [2024-10-24 07:27:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-24 07:27:17,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:17,890 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:17,909 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-24 07:27:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:18,091 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:18,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash -897192971, now seen corresponding path program 1 times [2024-10-24 07:27:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:18,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990062767] [2024-10-24 07:27:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:27:18,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240237021] [2024-10-24 07:27:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:18,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:18,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:18,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:27:18,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 07:27:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:27:18,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:27:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:27:18,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:27:18,539 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:27:18,540 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:27:18,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 07:27:18,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:18,746 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:18,869 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:27:18,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:27:18 BoogieIcfgContainer [2024-10-24 07:27:18,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:27:18,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:27:18,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:27:18,873 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:27:18,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:05" (3/4) ... [2024-10-24 07:27:18,876 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:27:18,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:27:18,878 INFO L158 Benchmark]: Toolchain (without parser) took 14633.55ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 79.0MB in the beginning and 154.7MB in the end (delta: -75.7MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2024-10-24 07:27:18,878 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:27:18,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.99ms. Allocated memory is still 151.0MB. Free memory was 78.8MB in the beginning and 115.4MB in the end (delta: -36.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-10-24 07:27:18,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.92ms. Allocated memory is still 151.0MB. Free memory was 115.4MB in the beginning and 110.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:27:18,879 INFO L158 Benchmark]: Boogie Preprocessor took 90.17ms. Allocated memory is still 151.0MB. Free memory was 110.7MB in the beginning and 104.9MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 07:27:18,879 INFO L158 Benchmark]: RCFGBuilder took 678.90ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 71.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 07:27:18,879 INFO L158 Benchmark]: TraceAbstraction took 13381.15ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 70.9MB in the beginning and 154.7MB in the end (delta: -83.8MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-10-24 07:27:18,880 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 318.8MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:27:18,882 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.17ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.99ms. Allocated memory is still 151.0MB. Free memory was 78.8MB in the beginning and 115.4MB in the end (delta: -36.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.92ms. Allocated memory is still 151.0MB. Free memory was 115.4MB in the beginning and 110.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.17ms. Allocated memory is still 151.0MB. Free memory was 110.7MB in the beginning and 104.9MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 678.90ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 71.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13381.15ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 70.9MB in the beginning and 154.7MB in the end (delta: -83.8MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 318.8MB. Free memory is still 154.7MB. 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 190, overapproximation of shiftRight at line 115, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.75; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 9.6; [L25] double var_1_4 = 7.625; [L26] double var_1_5 = 1.5; [L27] double var_1_6 = 63.17; [L28] double var_1_7 = 15.5; [L29] unsigned short int var_1_8 = 4; [L30] unsigned short int var_1_9 = 45624; [L31] unsigned short int var_1_10 = 39447; [L32] unsigned short int var_1_11 = 10; [L33] double var_1_12 = 255.5; [L34] double var_1_13 = 0.0; [L35] double var_1_14 = 127.5; [L36] float var_1_15 = 8.2; [L37] float var_1_16 = 2.8; [L38] signed short int var_1_17 = 8; [L39] double var_1_18 = 24.8; [L40] signed short int var_1_19 = -256; [L41] signed short int var_1_20 = 8; [L42] signed short int var_1_21 = 16; [L43] unsigned short int var_1_22 = 2; [L44] unsigned short int var_1_24 = 16; [L45] unsigned char var_1_25 = 0; [L46] unsigned short int var_1_26 = 1; [L47] double var_1_28 = 199.6; [L48] signed char var_1_33 = 5; [L49] signed char var_1_35 = -1; [L50] double var_1_36 = 0.6; [L51] double var_1_39 = 16.5; [L52] double var_1_40 = 0.2; [L53] float var_1_41 = 31.45; [L54] signed short int var_1_43 = -10; [L55] unsigned long int var_1_44 = 25; [L56] signed short int var_1_45 = 24450; [L57] unsigned long int var_1_46 = 8; [L58] signed short int var_1_47 = -4; [L59] unsigned short int last_1_var_1_22 = 2; [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L187] last_1_var_1_22 = var_1_22 [L197] RET updateLastVariables() [L198] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L136] var_1_3 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L137] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L138] var_1_4 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L139] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L140] var_1_5 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L141] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L142] var_1_6 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L143] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L144] var_1_7 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L145] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L146] var_1_9 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L147] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L148] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L148] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L149] var_1_10 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L150] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L151] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L151] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L152] var_1_11 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L153] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L154] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L154] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L155] var_1_13 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L156] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L157] var_1_18 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L158] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L159] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L159] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L160] var_1_19 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_19 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L161] RET assume_abort_if_not(var_1_19 >= -32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L162] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L162] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L163] var_1_20 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L164] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L165] CALL assume_abort_if_not(var_1_20 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L165] RET assume_abort_if_not(var_1_20 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L166] var_1_21 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_21 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L167] RET assume_abort_if_not(var_1_21 >= -32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L168] CALL assume_abort_if_not(var_1_21 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L168] RET assume_abort_if_not(var_1_21 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L171] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L171] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L172] var_1_35 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_35 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L173] RET assume_abort_if_not(var_1_35 >= -127) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L174] CALL assume_abort_if_not(var_1_35 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L174] RET assume_abort_if_not(var_1_35 <= 126) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L175] var_1_39 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L176] RET assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L177] var_1_40 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_40 >= -461168.6018427382800e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 4611686.018427382800e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L178] RET assume_abort_if_not((var_1_40 >= -461168.6018427382800e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 4611686.018427382800e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L179] var_1_44 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_44 >= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L180] RET assume_abort_if_not(var_1_44 >= 16) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L181] CALL assume_abort_if_not(var_1_44 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L181] RET assume_abort_if_not(var_1_44 <= 32) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L182] var_1_45 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_45 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L183] RET assume_abort_if_not(var_1_45 >= 16382) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L184] CALL assume_abort_if_not(var_1_45 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L184] RET assume_abort_if_not(var_1_45 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32768] [L198] RET updateVariables() [L199] CALL step() [L63] COND TRUE \read(var_1_2) [L64] var_1_1 = (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=4, var_1_9=32768] [L66] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L67] COND TRUE \read(var_1_2) [L68] var_1_12 = (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L70] COND TRUE \read(var_1_2) [L71] var_1_33 = var_1_35 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L73] COND TRUE var_1_3 >= var_1_6 [L74] var_1_46 = ((((var_1_10) > (4u)) ? (var_1_10) : (4u))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L76] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L77] COND FALSE !(var_1_11 > var_1_10) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L80] COND TRUE var_1_11 != var_1_9 [L81] var_1_36 = ((((99999.5) < 0 ) ? -(99999.5) : (99999.5))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_41=629/20, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L84] COND FALSE !(var_1_11 < (((((var_1_11) < (var_1_20)) ? (var_1_11) : (var_1_20))) / var_1_9)) [L87] var_1_41 = ((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L89] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L96] COND TRUE var_1_3 <= var_1_4 [L97] var_1_16 = ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L99] var_1_26 = var_1_9 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L100] EXPR var_1_11 ^ 8 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L100] COND FALSE !(((var_1_11 ^ 8) * var_1_10) <= var_1_21) [L103] unsigned short int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=8, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L104] COND FALSE !(var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) [L113] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L115] EXPR ((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) >> (var_1_44 - 4u) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=-10, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L115] COND FALSE !((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) >> (var_1_44 - 4u)) >= var_1_9) [L118] COND TRUE ((((((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) > (var_1_10)) ? (((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) : (var_1_10))) > var_1_9 [L119] var_1_43 = 5 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L122] COND TRUE (var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19) [L123] var_1_22 = (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L125] var_1_47 = var_1_45 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L126] COND FALSE !(var_1_9 < var_1_11) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=0, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L199] RET step() [L200] CALL, EXPR property() [L190-L191] return ((((((((var_1_2 ? (var_1_1 == ((double) (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))))) : 1) && (var_1_8 == ((unsigned short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11)))) && (var_1_2 ? (var_1_12 == ((double) (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))))) : 1)) && (var_1_14 == ((double) var_1_6))) && ((var_1_13 >= var_1_14) ? (var_1_2 ? ((var_1_8 == var_1_11) ? (var_1_15 == ((float) 10.975f)) : 1) : 1) : 1)) && ((var_1_3 <= var_1_4) ? (var_1_16 == ((float) ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : 1)) && ((var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) ? (((var_1_10 + var_1_9) <= var_1_11) ? (var_1_2 ? (var_1_17 == ((signed short int) var_1_19)) : 1) : (var_1_17 == ((signed short int) (var_1_20 - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) : (var_1_17 == ((signed short int) var_1_21)))) && (((var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19)) ? (var_1_22 == ((unsigned short int) (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))))) : 1)) && ((var_1_9 < var_1_11) ? ((var_1_2 || var_1_25) ? (var_1_24 == ((unsigned short int) 128)) : 1) : 1) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=0, var_1_12=3, var_1_14=6, var_1_15=41/5, var_1_16=6, var_1_17=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32768, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=4, var_1_40=0, var_1_41=5, var_1_43=5, var_1_44=16, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=6, var_1_7=0, var_1_8=32768, var_1_9=32768] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 10, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1552 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1534 mSDsluCounter, 3227 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1946 mSDsCounter, 598 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2545 IncrementalHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 598 mSolverCounterUnsat, 1281 mSDtfsCounter, 2545 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1975 GetRequests, 1856 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=4, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 509 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2892 NumberOfCodeBlocks, 2892 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3081 ConstructedInterpolants, 0 QuantifiedInterpolants, 7105 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1419 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 29199/29760 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-24 07:27:18,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.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 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:27:21,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:27:21,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:27:21,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:27:21,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:27:21,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:27:21,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:27:21,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:27:21,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:27:21,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:27:21,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:27:21,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:27:21,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:27:21,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:27:21,281 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:27:21,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:27:21,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:27:21,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:27:21,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:27:21,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:27:21,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:27:21,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:27:21,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:27:21,284 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:27:21,284 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:27:21,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:27:21,285 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:27:21,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:27:21,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:27:21,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:27:21,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:27:21,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:27:21,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:27:21,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:27:21,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:21,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:27:21,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:27:21,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:27:21,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:27:21,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:27:21,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:27:21,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:27:21,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:27:21,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:27:21,297 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:27:21,297 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 -> 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 [2024-10-24 07:27:21,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:27:21,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:27:21,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:27:21,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:27:21,665 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:27:21,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-24 07:27:23,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:27:23,435 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:27:23,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-24 07:27:23,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dbe10816/bdf27c5674714ec58dde0f9552f2c499/FLAGe4aee44de [2024-10-24 07:27:23,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dbe10816/bdf27c5674714ec58dde0f9552f2c499 [2024-10-24 07:27:23,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:27:23,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:27:23,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:23,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:27:23,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:27:23,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:23" (1/1) ... [2024-10-24 07:27:23,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c9f6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:23, skipping insertion in model container [2024-10-24 07:27:23,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:23" (1/1) ... [2024-10-24 07:27:23,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:27:24,033 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-10-24 07:27:24,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:24,151 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:27:24,164 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-10-24 07:27:24,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:24,221 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:27:24,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24 WrapperNode [2024-10-24 07:27:24,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:24,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:24,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:27:24,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:27:24,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,303 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-10-24 07:27:24,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:24,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:27:24,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:27:24,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:27:24,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,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-24 07:27:24,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:27:24,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:27:24,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:27:24,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:27:24,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (1/1) ... [2024-10-24 07:27:24,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:24,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:24,428 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-24 07:27:24,432 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-24 07:27:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:27:24,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:27:24,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:27:24,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:27:24,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:27:24,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:27:24,586 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:27:24,589 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:27:40,812 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 07:27:40,812 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:27:40,858 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:27:40,858 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:27:40,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:40 BoogieIcfgContainer [2024-10-24 07:27:40,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:27:40,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:27:40,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:27:40,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:27:40,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:27:23" (1/3) ... [2024-10-24 07:27:40,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328b329e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:40, skipping insertion in model container [2024-10-24 07:27:40,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:24" (2/3) ... [2024-10-24 07:27:40,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328b329e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:40, skipping insertion in model container [2024-10-24 07:27:40,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:40" (3/3) ... [2024-10-24 07:27:40,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-10-24 07:27:40,885 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:27:40,885 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:27:40,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:27:40,958 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;@280ee230, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:27:40,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:27:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:27:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-24 07:27:40,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:40,980 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:40,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:40,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash 29493037, now seen corresponding path program 1 times [2024-10-24 07:27:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657311472] [2024-10-24 07:27:40,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:41,000 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-24 07:27:41,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:41,002 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-24 07:27:41,003 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-24 07:27:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:42,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:27:42,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-10-24 07:27:42,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:27:42,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:27:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657311472] [2024-10-24 07:27:42,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657311472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:42,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:42,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:27:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336014889] [2024-10-24 07:27:42,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:42,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:27:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:27:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:27:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:27:42,470 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 07:27:46,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:46,827 INFO L93 Difference]: Finished difference Result 177 states and 318 transitions. [2024-10-24 07:27:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:27:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-10-24 07:27:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:46,953 INFO L225 Difference]: With dead ends: 177 [2024-10-24 07:27:46,953 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 07:27:46,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:27:46,960 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:46,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 07:27:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 07:27:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 07:27:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:27:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 139 transitions. [2024-10-24 07:27:47,008 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 139 transitions. Word has length 203 [2024-10-24 07:27:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:47,009 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 139 transitions. [2024-10-24 07:27:47,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 07:27:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2024-10-24 07:27:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-24 07:27:47,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:47,014 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:27:47,053 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-24 07:27:47,214 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-24 07:27:47,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:47,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash -556320151, now seen corresponding path program 1 times [2024-10-24 07:27:47,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:47,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139290353] [2024-10-24 07:27:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:47,217 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-24 07:27:47,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:47,221 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-24 07:27:47,223 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-24 07:27:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:48,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:27:48,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:27:48,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:27:48,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:27:48,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139290353] [2024-10-24 07:27:48,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139290353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:48,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:48,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:27:48,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328292774] [2024-10-24 07:27:48,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:48,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:27:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:27:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:27:48,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:27:48,778 INFO L87 Difference]: Start difference. First operand 88 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:27:54,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:58,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:28:02,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:28:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:28:02,621 INFO L93 Difference]: Finished difference Result 204 states and 324 transitions. [2024-10-24 07:28:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:28:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-24 07:28:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:28:02,625 INFO L225 Difference]: With dead ends: 204 [2024-10-24 07:28:02,625 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 07:28:02,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:28:02,627 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 41 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:28:02,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 254 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2024-10-24 07:28:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 07:28:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2024-10-24 07:28:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 71 states have internal predecessors, (101), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:28:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions. [2024-10-24 07:28:02,646 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 203 [2024-10-24 07:28:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:28:02,650 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 165 transitions. [2024-10-24 07:28:02,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:28:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions. [2024-10-24 07:28:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-24 07:28:02,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:28:02,655 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:28:02,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 07:28:02,855 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-24 07:28:02,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:28:02,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:28:02,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1744502439, now seen corresponding path program 1 times [2024-10-24 07:28:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:28:02,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519309033] [2024-10-24 07:28:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:28:02,859 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-24 07:28:02,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:28:02,861 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-24 07:28:02,861 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-24 07:28:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:28:04,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:28:04,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:28:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:28:04,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:28:04,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:28:04,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519309033] [2024-10-24 07:28:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519309033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:28:04,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:28:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:28:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117881136] [2024-10-24 07:28:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:28:04,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:28:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:28:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:28:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:28:04,339 INFO L87 Difference]: Start difference. First operand 105 states and 165 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:28:05,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:28:10,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:28:14,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:28:18,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:28:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:28:18,442 INFO L93 Difference]: Finished difference Result 221 states and 346 transitions. [2024-10-24 07:28:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:28:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-24 07:28:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:28:18,577 INFO L225 Difference]: With dead ends: 221 [2024-10-24 07:28:18,577 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 07:28:18,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:28:18,579 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 42 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:28:18,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 251 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 14.1s Time] [2024-10-24 07:28:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 07:28:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2024-10-24 07:28:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:28:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 171 transitions. [2024-10-24 07:28:18,595 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 171 transitions. Word has length 203 [2024-10-24 07:28:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:28:18,596 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 171 transitions. [2024-10-24 07:28:18,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:28:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 171 transitions. [2024-10-24 07:28:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-24 07:28:18,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:28:18,601 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:28:18,642 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-24 07:28:18,802 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-24 07:28:18,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:28:18,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:28:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1132623591, now seen corresponding path program 1 times [2024-10-24 07:28:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:28:18,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750864811] [2024-10-24 07:28:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:28:18,810 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-24 07:28:18,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:28:18,813 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-24 07:28:18,814 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-24 07:28:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:28:20,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 07:28:20,130 INFO L278 TraceCheckSpWp]: Computing forward predicates...