./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-pe-co_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-80.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 2e5885422b9a6628271328b26b3c480e215525e356c23ecd88999a9097947559 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:30:50,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:30:50,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:30:50,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:30:50,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:30:50,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:30:50,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:30:50,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:30:50,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:30:50,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:30:50,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:30:50,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:30:50,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:30:50,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:30:50,965 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:30:50,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:30:50,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:30:50,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:30:50,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:30:50,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:30:50,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:30:50,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:30:50,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:30:50,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:30:50,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:30:50,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:30:50,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:30:50,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:30:50,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:30:50,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:30:50,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:30:50,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:30:50,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:30:50,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:30:50,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:30:50,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:30:50,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:30:50,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:30:50,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:30:50,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:30:50,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:30:50,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:30:50,977 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 -> 2e5885422b9a6628271328b26b3c480e215525e356c23ecd88999a9097947559 [2024-10-14 09:30:51,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:30:51,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:30:51,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:30:51,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:30:51,247 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:30:51,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-80.i [2024-10-14 09:30:52,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:30:52,885 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:30:52,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-80.i [2024-10-14 09:30:52,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df393fe1f/ef4197e231f5464cafba564b8302f168/FLAGf73de10ef [2024-10-14 09:30:52,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df393fe1f/ef4197e231f5464cafba564b8302f168 [2024-10-14 09:30:52,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:30:52,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:30:52,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:30:52,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:30:52,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:30:52,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:30:52" (1/1) ... [2024-10-14 09:30:52,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b537816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:52, skipping insertion in model container [2024-10-14 09:30:52,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:30:52" (1/1) ... [2024-10-14 09:30:52,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:30:53,118 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-pe-co_file-80.i[919,932] [2024-10-14 09:30:53,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:30:53,237 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:30:53,252 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-pe-co_file-80.i[919,932] [2024-10-14 09:30:53,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:30:53,340 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:30:53,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53 WrapperNode [2024-10-14 09:30:53,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:30:53,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:30:53,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:30:53,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:30:53,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,473 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2024-10-14 09:30:53,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:30:53,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:30:53,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:30:53,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:30:53,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,561 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:30:53,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:30:53,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:30:53,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:30:53,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:30:53,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (1/1) ... [2024-10-14 09:30:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:30:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:30:53,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:30:53,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:30:53,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:30:53,704 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:30:53,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:30:53,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:30:53,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:30:53,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:30:53,807 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:30:53,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:30:54,289 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 09:30:54,289 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:30:54,337 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:30:54,338 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:30:54,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:30:54 BoogieIcfgContainer [2024-10-14 09:30:54,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:30:54,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:30:54,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:30:54,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:30:54,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:30:52" (1/3) ... [2024-10-14 09:30:54,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67afa353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:30:54, skipping insertion in model container [2024-10-14 09:30:54,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:30:53" (2/3) ... [2024-10-14 09:30:54,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67afa353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:30:54, skipping insertion in model container [2024-10-14 09:30:54,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:30:54" (3/3) ... [2024-10-14 09:30:54,349 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-80.i [2024-10-14 09:30:54,363 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:30:54,363 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:30:54,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:30:54,435 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;@34cddce6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:30:54,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:30:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:30:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-14 09:30:54,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:54,460 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:54,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:54,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1619870608, now seen corresponding path program 1 times [2024-10-14 09:30:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789348149] [2024-10-14 09:30:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:30:55,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:55,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789348149] [2024-10-14 09:30:55,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789348149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:30:55,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:30:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:30:55,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287569010] [2024-10-14 09:30:55,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:30:55,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:30:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:30:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:30:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:30:55,187 INFO L87 Difference]: Start difference. First operand has 99 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 09:30:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:30:55,250 INFO L93 Difference]: Finished difference Result 193 states and 349 transitions. [2024-10-14 09:30:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:30:55,254 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 220 [2024-10-14 09:30:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:30:55,262 INFO L225 Difference]: With dead ends: 193 [2024-10-14 09:30:55,262 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 09:30:55,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:30:55,274 INFO L432 NwaCegarLoop]: 147 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, 147 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:30:55,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:30:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 09:30:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 09:30:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:30:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 150 transitions. [2024-10-14 09:30:55,326 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 150 transitions. Word has length 220 [2024-10-14 09:30:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:30:55,327 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 150 transitions. [2024-10-14 09:30:55,328 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 09:30:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 150 transitions. [2024-10-14 09:30:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-14 09:30:55,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:55,334 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:30:55,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -227984794, now seen corresponding path program 1 times [2024-10-14 09:30:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867993229] [2024-10-14 09:30:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:30:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867993229] [2024-10-14 09:30:55,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867993229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:30:55,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:30:55,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:30:55,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519548507] [2024-10-14 09:30:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:30:55,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:30:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:30:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:30:55,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:55,874 INFO L87 Difference]: Start difference. First operand 95 states and 150 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:30:55,932 INFO L93 Difference]: Finished difference Result 190 states and 301 transitions. [2024-10-14 09:30:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:30:55,933 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-14 09:30:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:30:55,937 INFO L225 Difference]: With dead ends: 190 [2024-10-14 09:30:55,937 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 09:30:55,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:55,939 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:30:55,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:30:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 09:30:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-14 09:30:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:30:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 151 transitions. [2024-10-14 09:30:55,963 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 151 transitions. Word has length 220 [2024-10-14 09:30:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:30:55,968 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 151 transitions. [2024-10-14 09:30:55,969 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2024-10-14 09:30:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-14 09:30:55,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:55,976 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:55,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:30:55,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:55,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash -929049372, now seen corresponding path program 1 times [2024-10-14 09:30:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149962509] [2024-10-14 09:30:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:30:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149962509] [2024-10-14 09:30:56,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149962509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:30:56,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:30:56,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:30:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31947031] [2024-10-14 09:30:56,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:30:56,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:30:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:30:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:30:56,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:30:56,367 INFO L87 Difference]: Start difference. First operand 96 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:30:56,450 INFO L93 Difference]: Finished difference Result 286 states and 451 transitions. [2024-10-14 09:30:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:30:56,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-14 09:30:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:30:56,454 INFO L225 Difference]: With dead ends: 286 [2024-10-14 09:30:56,454 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 09:30:56,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:30:56,462 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 146 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:30:56,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 426 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:30:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 09:30:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 98. [2024-10-14 09:30:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:30:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 153 transitions. [2024-10-14 09:30:56,488 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 153 transitions. Word has length 220 [2024-10-14 09:30:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:30:56,489 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 153 transitions. [2024-10-14 09:30:56,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2024-10-14 09:30:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-14 09:30:56,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:56,492 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:56,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:30:56,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:56,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1371773218, now seen corresponding path program 1 times [2024-10-14 09:30:56,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:56,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643725931] [2024-10-14 09:30:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:56,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:30:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:56,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643725931] [2024-10-14 09:30:56,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643725931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:30:56,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:30:56,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:30:56,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203754950] [2024-10-14 09:30:56,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:30:56,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:30:56,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:30:56,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:30:56,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:56,962 INFO L87 Difference]: Start difference. First operand 98 states and 153 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:30:57,033 INFO L93 Difference]: Finished difference Result 292 states and 457 transitions. [2024-10-14 09:30:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:30:57,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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-14 09:30:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:30:57,038 INFO L225 Difference]: With dead ends: 292 [2024-10-14 09:30:57,038 INFO L226 Difference]: Without dead ends: 195 [2024-10-14 09:30:57,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:57,043 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 81 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:30:57,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 316 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:30:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-14 09:30:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2024-10-14 09:30:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 120 states have (on average 1.325) internal successors, (159), 120 states have internal predecessors, (159), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:30:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 299 transitions. [2024-10-14 09:30:57,084 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 299 transitions. Word has length 220 [2024-10-14 09:30:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:30:57,085 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 299 transitions. [2024-10-14 09:30:57,086 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 299 transitions. [2024-10-14 09:30:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-14 09:30:57,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:57,089 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:57,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:30:57,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:57,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1746697822, now seen corresponding path program 1 times [2024-10-14 09:30:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:57,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575893265] [2024-10-14 09:30:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:30:57,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575893265] [2024-10-14 09:30:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575893265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:30:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:30:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:30:57,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720200167] [2024-10-14 09:30:57,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:30:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:30:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:30:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:30:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:57,332 INFO L87 Difference]: Start difference. First operand 193 states and 299 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:30:57,359 INFO L93 Difference]: Finished difference Result 288 states and 443 transitions. [2024-10-14 09:30:57,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:30:57,362 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-14 09:30:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:30:57,364 INFO L225 Difference]: With dead ends: 288 [2024-10-14 09:30:57,364 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 09:30:57,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:57,367 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:30:57,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:30:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 09:30:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-14 09:30:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:30:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2024-10-14 09:30:57,380 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 220 [2024-10-14 09:30:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:30:57,381 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2024-10-14 09:30:57,381 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2024-10-14 09:30:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 09:30:57,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:57,383 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:30:57,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:57,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1297727167, now seen corresponding path program 1 times [2024-10-14 09:30:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:57,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613669253] [2024-10-14 09:30:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:30:57,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613669253] [2024-10-14 09:30:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613669253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:30:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:30:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:30:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965600811] [2024-10-14 09:30:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:30:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:30:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:30:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:30:57,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:57,849 INFO L87 Difference]: Start difference. First operand 96 states and 144 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:30:57,932 INFO L93 Difference]: Finished difference Result 286 states and 430 transitions. [2024-10-14 09:30:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:30:57,933 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-10-14 09:30:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:30:57,935 INFO L225 Difference]: With dead ends: 286 [2024-10-14 09:30:57,935 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 09:30:57,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:57,940 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:30:57,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 259 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:30:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 09:30:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-10-14 09:30:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 116 states have internal predecessors, (144), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:30:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 284 transitions. [2024-10-14 09:30:57,983 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 284 transitions. Word has length 222 [2024-10-14 09:30:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:30:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 284 transitions. [2024-10-14 09:30:57,986 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 284 transitions. [2024-10-14 09:30:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 09:30:57,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:57,989 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:57,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:30:57,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:57,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1003095423, now seen corresponding path program 1 times [2024-10-14 09:30:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:57,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687300927] [2024-10-14 09:30:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:30:58,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687300927] [2024-10-14 09:30:58,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687300927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:30:58,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:30:58,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:30:58,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495416080] [2024-10-14 09:30:58,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:30:58,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:30:58,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:30:58,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:30:58,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:30:58,352 INFO L87 Difference]: Start difference. First operand 189 states and 284 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:30:58,570 INFO L93 Difference]: Finished difference Result 453 states and 682 transitions. [2024-10-14 09:30:58,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:30:58,571 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-10-14 09:30:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:30:58,574 INFO L225 Difference]: With dead ends: 453 [2024-10-14 09:30:58,574 INFO L226 Difference]: Without dead ends: 265 [2024-10-14 09:30:58,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:30:58,576 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 142 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:30:58,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 346 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:30:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-14 09:30:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 187. [2024-10-14 09:30:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 114 states have internal predecessors, (140), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:30:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 280 transitions. [2024-10-14 09:30:58,605 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 280 transitions. Word has length 222 [2024-10-14 09:30:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:30:58,606 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 280 transitions. [2024-10-14 09:30:58,606 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 280 transitions. [2024-10-14 09:30:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-14 09:30:58,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:58,609 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:58,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 09:30:58,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:58,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2114490417, now seen corresponding path program 1 times [2024-10-14 09:30:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:58,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780070669] [2024-10-14 09:30:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:30:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:58,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780070669] [2024-10-14 09:30:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780070669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:30:58,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:30:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:30:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419521607] [2024-10-14 09:30:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:30:58,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:30:58,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:30:58,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:30:58,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:58,820 INFO L87 Difference]: Start difference. First operand 187 states and 280 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:30:58,866 INFO L93 Difference]: Finished difference Result 373 states and 559 transitions. [2024-10-14 09:30:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:30:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-10-14 09:30:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:30:58,869 INFO L225 Difference]: With dead ends: 373 [2024-10-14 09:30:58,870 INFO L226 Difference]: Without dead ends: 187 [2024-10-14 09:30:58,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:30:58,872 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:30:58,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:30:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-14 09:30:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-10-14 09:30:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 114 states have (on average 1.2105263157894737) internal successors, (138), 114 states have internal predecessors, (138), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:30:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 278 transitions. [2024-10-14 09:30:58,909 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 278 transitions. Word has length 223 [2024-10-14 09:30:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:30:58,909 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 278 transitions. [2024-10-14 09:30:58,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:30:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 278 transitions. [2024-10-14 09:30:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-14 09:30:58,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:30:58,912 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:30:58,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 09:30:58,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:30:58,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:30:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1479412301, now seen corresponding path program 1 times [2024-10-14 09:30:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:30:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52174003] [2024-10-14 09:30:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:30:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:30:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:30:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:30:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:30:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:30:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:30:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:30:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:30:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:30:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:30:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:30:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:30:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:30:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:30:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:30:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:30:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:30:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:30:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:30:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:30:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:30:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:30:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:30:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:30:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:30:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:30:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:30:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:30:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:30:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:30:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:30:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:30:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:30:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:30:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:30:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-14 09:30:59,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:30:59,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52174003] [2024-10-14 09:30:59,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52174003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:30:59,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687252055] [2024-10-14 09:30:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:30:59,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:30:59,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:30:59,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:30:59,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 09:30:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:30:59,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 09:30:59,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:30:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2024-10-14 09:30:59,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:31:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-14 09:31:00,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687252055] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:31:00,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:31:00,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2024-10-14 09:31:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058299320] [2024-10-14 09:31:00,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:31:00,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 09:31:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:31:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 09:31:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:31:00,209 INFO L87 Difference]: Start difference. First operand 187 states and 278 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-10-14 09:31:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:31:00,810 INFO L93 Difference]: Finished difference Result 483 states and 708 transitions. [2024-10-14 09:31:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 09:31:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 223 [2024-10-14 09:31:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:31:00,813 INFO L225 Difference]: With dead ends: 483 [2024-10-14 09:31:00,814 INFO L226 Difference]: Without dead ends: 297 [2024-10-14 09:31:00,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2024-10-14 09:31:00,815 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 162 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:31:00,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 327 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:31:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-14 09:31:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 193. [2024-10-14 09:31:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 118 states have internal predecessors, (140), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:31:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 280 transitions. [2024-10-14 09:31:00,875 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 280 transitions. Word has length 223 [2024-10-14 09:31:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:31:00,877 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 280 transitions. [2024-10-14 09:31:00,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2024-10-14 09:31:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 280 transitions. [2024-10-14 09:31:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-14 09:31:00,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:31:00,880 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:31:00,899 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-14 09:31:01,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:31:01,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:31:01,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:31:01,081 INFO L85 PathProgramCache]: Analyzing trace with hash 907011992, now seen corresponding path program 1 times [2024-10-14 09:31:01,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:31:01,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856580618] [2024-10-14 09:31:01,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:31:01,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:31:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:31:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:31:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:31:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:31:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 09:31:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:31:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:31:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:31:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:31:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:31:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:31:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:31:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 09:31:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 09:31:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 09:31:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 09:31:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:31:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 09:31:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 09:31:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 09:31:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 09:31:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 09:31:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 09:31:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 09:31:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 09:31:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 09:31:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 09:31:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 09:31:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 09:31:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 09:31:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 09:31:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 09:31:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 09:31:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 09:31:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 09:31:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-14 09:31:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:31:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856580618] [2024-10-14 09:31:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856580618] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:31:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509910089] [2024-10-14 09:31:01,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:31:01,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:31:01,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:31:01,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:31:01,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 09:31:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:01,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 09:31:01,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:31:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 995 proven. 48 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2024-10-14 09:31:02,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:31:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-14 09:31:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509910089] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:31:02,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:31:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 15 [2024-10-14 09:31:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676527460] [2024-10-14 09:31:02,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:31:02,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 09:31:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:31:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 09:31:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-14 09:31:02,564 INFO L87 Difference]: Start difference. First operand 193 states and 280 transitions. Second operand has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 4 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2024-10-14 09:31:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:31:03,022 INFO L93 Difference]: Finished difference Result 397 states and 569 transitions. [2024-10-14 09:31:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 09:31:03,023 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 4 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) Word has length 224 [2024-10-14 09:31:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:31:03,025 INFO L225 Difference]: With dead ends: 397 [2024-10-14 09:31:03,025 INFO L226 Difference]: Without dead ends: 205 [2024-10-14 09:31:03,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-14 09:31:03,027 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 159 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:31:03,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 304 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:31:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-14 09:31:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2024-10-14 09:31:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 124 states have (on average 1.1612903225806452) internal successors, (144), 124 states have internal predecessors, (144), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:31:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 284 transitions. [2024-10-14 09:31:03,072 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 284 transitions. Word has length 224 [2024-10-14 09:31:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:31:03,072 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 284 transitions. [2024-10-14 09:31:03,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 4 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2024-10-14 09:31:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 284 transitions. [2024-10-14 09:31:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-14 09:31:03,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:31:03,076 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:31:03,095 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-14 09:31:03,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 09:31:03,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:31:03,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:31:03,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1307918534, now seen corresponding path program 1 times [2024-10-14 09:31:03,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:31:03,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014732505] [2024-10-14 09:31:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:31:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:31:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:31:03,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:31:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:31:03,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:31:03,569 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:31:03,570 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:31:03,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 09:31:03,575 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:31:03,715 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:31:03,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:31:03 BoogieIcfgContainer [2024-10-14 09:31:03,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:31:03,719 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:31:03,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:31:03,720 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:31:03,720 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:30:54" (3/4) ... [2024-10-14 09:31:03,722 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:31:03,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:31:03,724 INFO L158 Benchmark]: Toolchain (without parser) took 10804.66ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 133.7MB in the beginning and 120.7MB in the end (delta: 12.9MB). Peak memory consumption was 148.7MB. Max. memory is 16.1GB. [2024-10-14 09:31:03,725 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:31:03,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.61ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 116.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 09:31:03,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.55ms. Allocated memory is still 201.3MB. Free memory was 116.5MB in the beginning and 172.4MB in the end (delta: -55.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-14 09:31:03,725 INFO L158 Benchmark]: Boogie Preprocessor took 128.94ms. Allocated memory is still 201.3MB. Free memory was 172.4MB in the beginning and 165.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 09:31:03,725 INFO L158 Benchmark]: RCFGBuilder took 733.63ms. Allocated memory is still 201.3MB. Free memory was 165.1MB in the beginning and 131.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 09:31:03,726 INFO L158 Benchmark]: TraceAbstraction took 9378.42ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 131.6MB in the beginning and 120.7MB in the end (delta: 10.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. [2024-10-14 09:31:03,726 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 335.5MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:31:03,727 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.16ms. Allocated memory is still 109.1MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.61ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 116.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.55ms. Allocated memory is still 201.3MB. Free memory was 116.5MB in the beginning and 172.4MB in the end (delta: -55.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.94ms. Allocated memory is still 201.3MB. Free memory was 172.4MB in the beginning and 165.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 733.63ms. Allocated memory is still 201.3MB. Free memory was 165.1MB in the beginning and 131.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9378.42ms. Allocated memory was 201.3MB in the beginning and 335.5MB in the end (delta: 134.2MB). Free memory was 131.6MB in the beginning and 120.7MB in the end (delta: 10.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 335.5MB. Free memory is still 120.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 someBinaryDOUBLEComparisonOperation at line 194, overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someBinaryArithmeticDOUBLEoperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] float var_1_27 = 128.75; [L44] double var_1_28 = 9.25; [L45] double var_1_29 = 0.0; [L46] double var_1_30 = 127.6; [L47] double var_1_31 = 64.75; [L48] unsigned long int var_1_32 = 128; [L49] unsigned long int var_1_34 = 1089279310; [L50] unsigned long int var_1_35 = 1307137784; [L51] unsigned long int var_1_36 = 1417807175; [L52] unsigned long int var_1_38 = 2; [L53] unsigned long int var_1_39 = 2676616107; [L54] unsigned short int var_1_40 = 5; [L55] unsigned char var_1_44 = 5; [L56] unsigned char var_1_45 = 4; [L57] unsigned char var_1_46 = 16; [L58] unsigned char last_1_var_1_10 = 200; [L198] isInitial = 1 [L199] FCALL initially() [L200] COND TRUE 1 [L201] CALL updateLastVariables() [L191] last_1_var_1_10 = var_1_10 [L201] RET updateLastVariables() [L202] CALL updateVariables() [L131] var_1_2 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L132] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L133] var_1_3 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L134] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L135] var_1_4 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L136] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L137] var_1_5 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L138] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L140] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L141] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L141] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L143] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L144] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L144] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L146] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L147] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L147] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L148] var_1_15 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L149] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L150] var_1_16 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L151] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L152] var_1_17 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L153] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L154] var_1_20 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L156] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L156] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L157] var_1_21 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L158] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L159] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L159] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L160] var_1_23 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L161] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L162] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L162] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L163] var_1_27 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L164] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L165] var_1_29 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L166] RET assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L167] var_1_30 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L168] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_31=259/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L169] var_1_31 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L170] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L171] var_1_34 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_34 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L172] RET assume_abort_if_not(var_1_34 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L173] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L173] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L174] var_1_35 = __VERIFIER_nondet_ulong() [L175] CALL assume_abort_if_not(var_1_35 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L175] RET assume_abort_if_not(var_1_35 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L176] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L176] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L177] var_1_36 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_36 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L178] RET assume_abort_if_not(var_1_36 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L179] CALL assume_abort_if_not(var_1_36 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L179] RET assume_abort_if_not(var_1_36 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=2676616107, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L180] var_1_39 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L181] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L182] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L182] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=4, var_1_46=16, var_1_9=-25] [L183] var_1_45 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L184] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L185] CALL assume_abort_if_not(var_1_45 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=16, var_1_9=-25] [L185] RET assume_abort_if_not(var_1_45 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=16, var_1_9=-25] [L186] var_1_46 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_46 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_9=-25] [L187] RET assume_abort_if_not(var_1_46 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_9=-25] [L188] CALL assume_abort_if_not(var_1_46 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-25] [L188] RET assume_abort_if_not(var_1_46 <= 127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-25] [L202] RET updateVariables() [L203] CALL step() [L62] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-25] [L63] COND TRUE stepLocal_0 >= last_1_var_1_10 [L64] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L68] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L69] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L72] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L75] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L76] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L79] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L80] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L84] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L87] COND FALSE !(\read(var_1_19)) [L90] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L92] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L93] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L94] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L99] EXPR var_1_14 & var_1_14 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L99] COND TRUE (var_1_14 & var_1_14) >= -2 [L100] var_1_24 = var_1_27 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L102] var_1_28 = ((8.18603254193775E18 - (var_1_29 - var_1_30)) - var_1_31) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L103] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L106] EXPR var_1_35 | var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=2, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L106] COND TRUE (var_1_35 | var_1_10) > var_1_14 [L107] COND TRUE var_1_29 <= ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) [L108] var_1_38 = ((((var_1_18) < ((((((var_1_39) < 0 ) ? -(var_1_39) : (var_1_39))) - var_1_36))) ? (var_1_18) : ((((((var_1_39) < 0 ) ? -(var_1_39) : (var_1_39))) - var_1_36)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=-1073741826, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L117] COND FALSE !((((((var_1_30 * var_1_24)) < (var_1_29)) ? ((var_1_30 * var_1_24)) : (var_1_29))) >= (- var_1_27)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=-1073741826, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L124] EXPR var_1_10 & var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=-1073741826, var_1_39=-2, var_1_40=5, var_1_44=5, var_1_45=137, var_1_46=127, var_1_9=-56] [L124] COND TRUE -32 < (var_1_10 & var_1_10) [L125] var_1_44 = ((((var_1_45) < ((var_1_46 + 10))) ? (var_1_45) : ((var_1_46 + 10)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=-1073741826, var_1_39=-2, var_1_40=5, var_1_44=137, var_1_45=137, var_1_46=127, var_1_9=-56] [L203] RET step() [L204] CALL, EXPR property() [L194-L195] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=-1073741826, var_1_39=-2, var_1_40=5, var_1_44=137, var_1_45=137, var_1_46=127, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_27=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=-2147483649, var_1_36=1073741824, var_1_38=-1073741826, var_1_39=-2, var_1_40=5, var_1_44=137, var_1_45=137, var_1_46=127, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 804 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 753 mSDsluCounter, 2962 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1499 mSDsCounter, 329 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 329 mSolverCounterUnsat, 1463 mSDtfsCounter, 668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1682 GetRequests, 1635 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=10, InterpolantAutomatonStates: 53, 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, 10 MinimizatonAttempts, 283 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2886 NumberOfCodeBlocks, 2886 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3094 ConstructedInterpolants, 0 QuantifiedInterpolants, 6538 SizeOfPredicates, 5 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 33137/33320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 09:31:03,762 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-pe-co_file-80.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 2e5885422b9a6628271328b26b3c480e215525e356c23ecd88999a9097947559 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:31:06,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:31:06,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:31:06,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:31:06,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:31:06,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:31:06,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:31:06,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:31:06,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:31:06,271 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:31:06,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:31:06,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:31:06,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:31:06,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:31:06,272 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:31:06,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:31:06,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:31:06,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:31:06,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:31:06,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:31:06,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:31:06,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:31:06,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:31:06,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:31:06,278 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:31:06,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:31:06,279 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:31:06,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:31:06,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:31:06,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:31:06,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:31:06,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:31:06,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:31:06,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:31:06,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:31:06,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:31:06,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:31:06,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:31:06,285 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:31:06,285 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:31:06,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:31:06,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:31:06,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:31:06,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:31:06,286 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:31:06,287 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 -> 2e5885422b9a6628271328b26b3c480e215525e356c23ecd88999a9097947559 [2024-10-14 09:31:06,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:31:06,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:31:06,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:31:06,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:31:06,663 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:31:06,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-80.i [2024-10-14 09:31:08,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:31:08,604 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:31:08,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-80.i [2024-10-14 09:31:08,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/093ddeb66/a2f5c159c31b4841b5d04abd6b5d1dc2/FLAG966bff7bf [2024-10-14 09:31:08,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/093ddeb66/a2f5c159c31b4841b5d04abd6b5d1dc2 [2024-10-14 09:31:08,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:31:08,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:31:08,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:31:08,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:31:08,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:31:08,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:31:08" (1/1) ... [2024-10-14 09:31:08,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d8d05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:08, skipping insertion in model container [2024-10-14 09:31:08,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:31:08" (1/1) ... [2024-10-14 09:31:08,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:31:08,885 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-pe-co_file-80.i[919,932] [2024-10-14 09:31:08,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:31:09,010 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:31:09,024 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-pe-co_file-80.i[919,932] [2024-10-14 09:31:09,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:31:09,115 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:31:09,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09 WrapperNode [2024-10-14 09:31:09,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:31:09,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:31:09,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:31:09,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:31:09,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,188 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2024-10-14 09:31:09,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:31:09,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:31:09,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:31:09,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:31:09,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,228 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:31:09,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:31:09,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:31:09,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:31:09,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:31:09,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (1/1) ... [2024-10-14 09:31:09,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:31:09,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:31:09,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:31:09,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:31:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:31:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:31:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:31:09,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:31:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:31:09,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:31:09,505 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:31:09,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:31:36,637 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 09:31:36,638 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:31:36,720 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:31:36,723 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:31:36,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:31:36 BoogieIcfgContainer [2024-10-14 09:31:36,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:31:36,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:31:36,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:31:36,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:31:36,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:31:08" (1/3) ... [2024-10-14 09:31:36,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b4c191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:31:36, skipping insertion in model container [2024-10-14 09:31:36,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:31:09" (2/3) ... [2024-10-14 09:31:36,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b4c191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:31:36, skipping insertion in model container [2024-10-14 09:31:36,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:31:36" (3/3) ... [2024-10-14 09:31:36,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-80.i [2024-10-14 09:31:36,750 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:31:36,750 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:31:36,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:31:36,838 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;@5429783d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:31:36,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:31:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:31:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-14 09:31:36,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:31:36,866 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:31:36,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:31:36,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:31:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2058363762, now seen corresponding path program 1 times [2024-10-14 09:31:36,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:31:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689540672] [2024-10-14 09:31:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:31:36,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:31:36,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:31:36,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:31:36,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 09:31:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:38,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:31:38,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:31:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 1412 trivial. 0 not checked. [2024-10-14 09:31:38,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:31:38,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:31:38,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689540672] [2024-10-14 09:31:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689540672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:31:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:31:38,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:31:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863276775] [2024-10-14 09:31:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:31:38,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:31:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:31:38,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:31:38,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:31:38,317 INFO L87 Difference]: Start difference. First operand has 90 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 09:31:42,672 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-14 09:31:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:31:42,673 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2024-10-14 09:31:42,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:31:42,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 217 [2024-10-14 09:31:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:31:42,787 INFO L225 Difference]: With dead ends: 177 [2024-10-14 09:31:42,787 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 09:31:42,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:31:42,792 INFO L432 NwaCegarLoop]: 134 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, 134 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-14 09:31:42,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 09:31:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 09:31:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 09:31:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:31:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 137 transitions. [2024-10-14 09:31:42,834 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 137 transitions. Word has length 217 [2024-10-14 09:31:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:31:42,834 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 137 transitions. [2024-10-14 09:31:42,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 09:31:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 137 transitions. [2024-10-14 09:31:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-14 09:31:42,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:31:42,839 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:31:42,875 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 (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:31:43,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:31:43,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:31:43,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:31:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash 296555096, now seen corresponding path program 1 times [2024-10-14 09:31:43,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:31:43,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070508047] [2024-10-14 09:31:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:31:43,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:31:43,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:31:43,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:31:43,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 09:31:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:31:44,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 09:31:44,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:31:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:31:44,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:31:44,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:31:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070508047] [2024-10-14 09:31:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070508047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:31:44,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:31:44,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:31:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093472502] [2024-10-14 09:31:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:31:44,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:31:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:31:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:31:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:31:44,604 INFO L87 Difference]: Start difference. First operand 88 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:31:49,418 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 [0] [2024-10-14 09:31:53,427 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 [0] [2024-10-14 09:31:57,440 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-14 09:32:01,448 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 [0] [2024-10-14 09:32:05,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 09:32:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:32:05,583 INFO L93 Difference]: Finished difference Result 262 states and 409 transitions. [2024-10-14 09:32:05,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:32:05,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 217 [2024-10-14 09:32:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:32:05,588 INFO L225 Difference]: With dead ends: 262 [2024-10-14 09:32:05,588 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 09:32:05,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:32:05,590 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 133 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2024-10-14 09:32:05,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 387 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2024-10-14 09:32:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 09:32:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 90. [2024-10-14 09:32:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 09:32:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2024-10-14 09:32:05,619 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 217 [2024-10-14 09:32:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:32:05,625 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2024-10-14 09:32:05,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:32:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2024-10-14 09:32:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-14 09:32:05,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:32:05,630 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:32:05,671 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-14 09:32:05,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:32:05,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:32:05,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:32:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash -983308582, now seen corresponding path program 1 times [2024-10-14 09:32:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:32:05,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895391938] [2024-10-14 09:32:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:32:05,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:32:05,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:32:05,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:32:05,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 09:32:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:32:07,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 09:32:07,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:32:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 09:32:13,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:32:13,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:32:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895391938] [2024-10-14 09:32:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895391938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:32:13,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:32:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:32:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605342563] [2024-10-14 09:32:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:32:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:32:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:32:13,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:32:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:32:13,706 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 09:32:18,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []