./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.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 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:35:16,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:35:16,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:35:16,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:35:16,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:35:16,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:35:16,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:35:16,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:35:16,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:35:16,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:35:16,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:35:16,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:35:16,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:35:16,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:35:16,280 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:35:16,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:35:16,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:35:16,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:35:16,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:35:16,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:35:16,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:35:16,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:35:16,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:35:16,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:35:16,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:35:16,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:35:16,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:35:16,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:35:16,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:35:16,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:35:16,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:35:16,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:35:16,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:35:16,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:35:16,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:35:16,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:35:16,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:35:16,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:35:16,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:35:16,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:35:16,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:35:16,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:35:16,295 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 -> 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 [2024-11-08 21:35:16,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:35:16,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:35:16,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:35:16,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:35:16,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:35:16,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2024-11-08 21:35:18,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:35:18,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:35:18,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2024-11-08 21:35:18,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409ab0320/b40002e793d54cacb80494815638baa7/FLAGf886bb536 [2024-11-08 21:35:18,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/409ab0320/b40002e793d54cacb80494815638baa7 [2024-11-08 21:35:18,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:35:18,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:35:18,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:35:18,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:35:18,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:35:18,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:35:18" (1/1) ... [2024-11-08 21:35:18,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5b0b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:18, skipping insertion in model container [2024-11-08 21:35:18,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:35:18" (1/1) ... [2024-11-08 21:35:18,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:35:18,846 WARN L250 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-70.i[919,932] [2024-11-08 21:35:18,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:35:18,935 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:35:18,943 WARN L250 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-70.i[919,932] [2024-11-08 21:35:18,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:35:19,013 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:35:19,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19 WrapperNode [2024-11-08 21:35:19,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:35:19,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:35:19,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:35:19,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:35:19,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,107 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-08 21:35:19,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:35:19,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:35:19,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:35:19,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:35:19,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,146 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-11-08 21:35:19,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:35:19,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:35:19,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:35:19,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:35:19,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (1/1) ... [2024-11-08 21:35:19,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:35:19,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:35:19,244 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-11-08 21:35:19,249 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-11-08 21:35:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:35:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:35:19,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:35:19,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:35:19,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:35:19,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:35:19,391 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:35:19,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:35:19,810 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 21:35:19,811 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:35:19,826 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:35:19,827 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:35:19,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:35:19 BoogieIcfgContainer [2024-11-08 21:35:19,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:35:19,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:35:19,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:35:19,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:35:19,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:35:18" (1/3) ... [2024-11-08 21:35:19,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1effece8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:35:19, skipping insertion in model container [2024-11-08 21:35:19,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:19" (2/3) ... [2024-11-08 21:35:19,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1effece8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:35:19, skipping insertion in model container [2024-11-08 21:35:19,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:35:19" (3/3) ... [2024-11-08 21:35:19,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2024-11-08 21:35:19,852 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:35:19,853 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:35:19,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:35:19,925 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;@179dd704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:35:19,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:35:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 21:35:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:35:19,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:19,949 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:19,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:19,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 260735477, now seen corresponding path program 1 times [2024-11-08 21:35:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:19,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040164645] [2024-11-08 21:35:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:35:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:35:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:35:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:35:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:35:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:35:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:35:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:35:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:35:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:35:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 21:35:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040164645] [2024-11-08 21:35:20,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040164645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:20,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:20,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:35:20,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52836986] [2024-11-08 21:35:20,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:20,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:35:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:20,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:35:20,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:35:20,503 INFO L87 Difference]: Start difference. First operand has 86 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 21:35:20,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:20,547 INFO L93 Difference]: Finished difference Result 165 states and 289 transitions. [2024-11-08 21:35:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:35:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2024-11-08 21:35:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:20,560 INFO L225 Difference]: With dead ends: 165 [2024-11-08 21:35:20,560 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 21:35:20,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-11-08 21:35:20,570 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:20,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:35:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 21:35:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 21:35:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 21:35:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-11-08 21:35:20,636 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 164 [2024-11-08 21:35:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:20,637 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-11-08 21:35:20,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 21:35:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-11-08 21:35:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:35:20,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:20,643 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:20,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:35:20,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:20,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2003616775, now seen corresponding path program 1 times [2024-11-08 21:35:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:20,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518026702] [2024-11-08 21:35:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:35:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:35:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:35:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:35:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:35:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:35:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:35:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:35:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:35:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:35:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 21:35:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518026702] [2024-11-08 21:35:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518026702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:21,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:21,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:35:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950392205] [2024-11-08 21:35:21,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:21,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:35:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:35:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:35:21,044 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:35:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:21,128 INFO L93 Difference]: Finished difference Result 230 states and 354 transitions. [2024-11-08 21:35:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:35:21,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-11-08 21:35:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:21,135 INFO L225 Difference]: With dead ends: 230 [2024-11-08 21:35:21,135 INFO L226 Difference]: Without dead ends: 151 [2024-11-08 21:35:21,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-11-08 21:35:21,137 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 112 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:21,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 309 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:35:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-08 21:35:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2024-11-08 21:35:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 21:35:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2024-11-08 21:35:21,182 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 164 [2024-11-08 21:35:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:21,183 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2024-11-08 21:35:21,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:35:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2024-11-08 21:35:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:35:21,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:21,187 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:21,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:35:21,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1704544507, now seen corresponding path program 1 times [2024-11-08 21:35:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577831935] [2024-11-08 21:35:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:35:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:35:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:35:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:35:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:35:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:35:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:35:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:35:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:35:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:35:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 21:35:21,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577831935] [2024-11-08 21:35:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577831935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:35:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730316320] [2024-11-08 21:35:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:21,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:35:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:35:21,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:35:21,853 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:35:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:21,959 INFO L93 Difference]: Finished difference Result 408 states and 614 transitions. [2024-11-08 21:35:21,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:35:21,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-11-08 21:35:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:21,962 INFO L225 Difference]: With dead ends: 408 [2024-11-08 21:35:21,963 INFO L226 Difference]: Without dead ends: 262 [2024-11-08 21:35:21,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:35:21,965 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 111 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:21,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 358 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:35:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-08 21:35:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 221. [2024-11-08 21:35:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 160 states have (on average 1.3875) internal successors, (222), 162 states have internal predecessors, (222), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 21:35:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 334 transitions. [2024-11-08 21:35:22,005 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 334 transitions. Word has length 164 [2024-11-08 21:35:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:22,005 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 334 transitions. [2024-11-08 21:35:22,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:35:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 334 transitions. [2024-11-08 21:35:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:35:22,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:22,012 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:22,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:35:22,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:22,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash 693427257, now seen corresponding path program 1 times [2024-11-08 21:35:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:22,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723479706] [2024-11-08 21:35:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:35:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:35:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:35:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:35:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:35:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:35:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:35:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:35:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:35:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:35:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 21:35:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723479706] [2024-11-08 21:35:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723479706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:35:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913775969] [2024-11-08 21:35:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:35:23,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:35:23,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-11-08 21:35:23,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-11-08 21:35:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:23,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 21:35:23,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:35:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 633 proven. 72 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-08 21:35:25,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:35:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 75 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-08 21:35:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913775969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:35:27,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:35:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 28 [2024-11-08 21:35:27,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071780910] [2024-11-08 21:35:27,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:35:27,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 21:35:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 21:35:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-08 21:35:27,068 INFO L87 Difference]: Start difference. First operand 221 states and 334 transitions. Second operand has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 26 states have internal predecessors, (110), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) [2024-11-08 21:35:32,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:35:40,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:35:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:43,268 INFO L93 Difference]: Finished difference Result 1338 states and 1950 transitions. [2024-11-08 21:35:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-08 21:35:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 26 states have internal predecessors, (110), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) Word has length 164 [2024-11-08 21:35:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:43,279 INFO L225 Difference]: With dead ends: 1338 [2024-11-08 21:35:43,279 INFO L226 Difference]: Without dead ends: 1120 [2024-11-08 21:35:43,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2080, Invalid=8222, Unknown=0, NotChecked=0, Total=10302 [2024-11-08 21:35:43,287 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1565 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 1129 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1129 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:43,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 965 Invalid, 3070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1129 Valid, 1940 Invalid, 1 Unknown, 0 Unchecked, 10.5s Time] [2024-11-08 21:35:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-11-08 21:35:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 703. [2024-11-08 21:35:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 494 states have (on average 1.3400809716599191) internal successors, (662), 501 states have internal predecessors, (662), 185 states have call successors, (185), 23 states have call predecessors, (185), 23 states have return successors, (185), 178 states have call predecessors, (185), 185 states have call successors, (185) [2024-11-08 21:35:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1032 transitions. [2024-11-08 21:35:43,466 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1032 transitions. Word has length 164 [2024-11-08 21:35:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:43,467 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1032 transitions. [2024-11-08 21:35:43,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.074074074074074) internal successors, (110), 26 states have internal predecessors, (110), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) [2024-11-08 21:35:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1032 transitions. [2024-11-08 21:35:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:35:43,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:43,470 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:43,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:35:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:35:43,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1264262913, now seen corresponding path program 1 times [2024-11-08 21:35:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188723143] [2024-11-08 21:35:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:35:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:35:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:35:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:35:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:43,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:35:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:35:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:35:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:35:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:35:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:35:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 21:35:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:44,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188723143] [2024-11-08 21:35:44,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188723143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:35:44,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609085914] [2024-11-08 21:35:44,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:44,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:35:44,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:35:44,044 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-11-08 21:35:44,047 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-11-08 21:35:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:44,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:35:44,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:35:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-08 21:35:44,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:35:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 21:35:44,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609085914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:35:44,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:35:44,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 21:35:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9074952] [2024-11-08 21:35:44,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:35:44,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:35:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:44,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:35:44,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:35:44,822 INFO L87 Difference]: Start difference. First operand 703 states and 1032 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-08 21:35:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:45,100 INFO L93 Difference]: Finished difference Result 1010 states and 1461 transitions. [2024-11-08 21:35:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 21:35:45,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 164 [2024-11-08 21:35:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:45,107 INFO L225 Difference]: With dead ends: 1010 [2024-11-08 21:35:45,107 INFO L226 Difference]: Without dead ends: 436 [2024-11-08 21:35:45,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:35:45,110 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 120 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:45,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 232 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:35:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-08 21:35:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 392. [2024-11-08 21:35:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 258 states have (on average 1.2403100775193798) internal successors, (320), 259 states have internal predecessors, (320), 112 states have call successors, (112), 21 states have call predecessors, (112), 21 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-08 21:35:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 544 transitions. [2024-11-08 21:35:45,213 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 544 transitions. Word has length 164 [2024-11-08 21:35:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:45,214 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 544 transitions. [2024-11-08 21:35:45,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-08 21:35:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 544 transitions. [2024-11-08 21:35:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:35:45,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:45,217 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:45,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:35:45,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:35:45,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -890264627, now seen corresponding path program 1 times [2024-11-08 21:35:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692908165] [2024-11-08 21:35:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:35:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:35:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:35:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:35:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:35:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:35:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:35:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:35:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:35:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:35:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 21:35:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692908165] [2024-11-08 21:35:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692908165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:45,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:45,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:35:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171103085] [2024-11-08 21:35:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:45,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:35:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:35:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:35:45,771 INFO L87 Difference]: Start difference. First operand 392 states and 544 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:35:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:46,009 INFO L93 Difference]: Finished difference Result 582 states and 818 transitions. [2024-11-08 21:35:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:35:46,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-08 21:35:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:46,014 INFO L225 Difference]: With dead ends: 582 [2024-11-08 21:35:46,014 INFO L226 Difference]: Without dead ends: 420 [2024-11-08 21:35:46,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-11-08 21:35:46,016 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 103 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:46,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 363 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:35:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-08 21:35:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 392. [2024-11-08 21:35:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 258 states have (on average 1.2209302325581395) internal successors, (315), 259 states have internal predecessors, (315), 112 states have call successors, (112), 21 states have call predecessors, (112), 21 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-08 21:35:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 539 transitions. [2024-11-08 21:35:46,124 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 539 transitions. Word has length 165 [2024-11-08 21:35:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:46,125 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 539 transitions. [2024-11-08 21:35:46,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:35:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 539 transitions. [2024-11-08 21:35:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:35:46,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:46,127 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:35:46,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:46,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash 885833013, now seen corresponding path program 1 times [2024-11-08 21:35:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426916314] [2024-11-08 21:35:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:35:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:35:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:35:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:35:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:35:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 21:35:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:35:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:35:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:35:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:35:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 21:35:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426916314] [2024-11-08 21:35:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426916314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 21:35:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677339445] [2024-11-08 21:35:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:35:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:35:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:35:46,747 INFO L87 Difference]: Start difference. First operand 392 states and 539 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:35:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:48,294 INFO L93 Difference]: Finished difference Result 861 states and 1167 transitions. [2024-11-08 21:35:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 21:35:48,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-08 21:35:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:48,301 INFO L225 Difference]: With dead ends: 861 [2024-11-08 21:35:48,301 INFO L226 Difference]: Without dead ends: 637 [2024-11-08 21:35:48,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-08 21:35:48,303 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 326 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:48,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 638 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 21:35:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-08 21:35:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 400. [2024-11-08 21:35:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 266 states have (on average 1.2255639097744362) internal successors, (326), 267 states have internal predecessors, (326), 112 states have call successors, (112), 21 states have call predecessors, (112), 21 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-08 21:35:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 550 transitions. [2024-11-08 21:35:48,429 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 550 transitions. Word has length 165 [2024-11-08 21:35:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:48,429 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 550 transitions. [2024-11-08 21:35:48,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:35:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 550 transitions. [2024-11-08 21:35:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:35:48,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:48,432 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:48,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:35:48,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:48,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1634126921, now seen corresponding path program 1 times [2024-11-08 21:35:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064422124] [2024-11-08 21:35:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:35:48,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483991609] [2024-11-08 21:35:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:48,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:35:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:35:48,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:35:48,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:35:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:35:48,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:35:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:35:48,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:35:48,982 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:35:48,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:35:49,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:35:49,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:35:49,190 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:35:49,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:35:49,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:35:49 BoogieIcfgContainer [2024-11-08 21:35:49,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:35:49,300 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:35:49,300 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:35:49,301 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:35:49,301 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:35:19" (3/4) ... [2024-11-08 21:35:49,303 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:35:49,304 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:35:49,305 INFO L158 Benchmark]: Toolchain (without parser) took 30672.63ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 104.0MB in the beginning and 143.1MB in the end (delta: -39.1MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2024-11-08 21:35:49,305 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 59.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:35:49,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.43ms. Allocated memory is still 155.2MB. Free memory was 103.4MB in the beginning and 124.8MB in the end (delta: -21.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-08 21:35:49,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.01ms. Allocated memory is still 155.2MB. Free memory was 124.8MB in the beginning and 120.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:35:49,306 INFO L158 Benchmark]: Boogie Preprocessor took 98.93ms. Allocated memory is still 155.2MB. Free memory was 120.2MB in the beginning and 113.9MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:35:49,306 INFO L158 Benchmark]: RCFGBuilder took 621.26ms. Allocated memory is still 155.2MB. Free memory was 113.9MB in the beginning and 84.6MB in the end (delta: 29.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 21:35:49,307 INFO L158 Benchmark]: TraceAbstraction took 29469.54ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 84.6MB in the beginning and 143.1MB in the end (delta: -58.4MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2024-11-08 21:35:49,307 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 270.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:35:49,308 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 96.5MB. Free memory was 59.5MB in the beginning and 59.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.43ms. Allocated memory is still 155.2MB. Free memory was 103.4MB in the beginning and 124.8MB in the end (delta: -21.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.01ms. Allocated memory is still 155.2MB. Free memory was 124.8MB in the beginning and 120.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.93ms. Allocated memory is still 155.2MB. Free memory was 120.2MB in the beginning and 113.9MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 621.26ms. Allocated memory is still 155.2MB. Free memory was 113.9MB in the beginning and 84.6MB in the end (delta: 29.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29469.54ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 84.6MB in the beginning and 143.1MB in the end (delta: -58.4MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 270.5MB. Free memory is still 143.1MB. 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 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_30 = 1; [L40] unsigned char var_1_31 = 1; [L41] unsigned char var_1_32 = 0; [L42] unsigned long int var_1_33 = 2; [L43] unsigned short int var_1_34 = 0; [L44] signed short int var_1_35 = -10; [L45] double var_1_36 = 128.5; [L46] double var_1_37 = 128.25; [L47] unsigned char var_1_40 = 2; [L48] unsigned char var_1_41 = 25; [L49] unsigned short int var_1_42 = 8; [L50] unsigned long int var_1_43 = 3563499258; [L51] unsigned long int var_1_44 = 1249494912; [L52] double last_1_var_1_1 = 5.05; [L53] unsigned short int last_1_var_1_9 = 1; [L54] unsigned long int last_1_var_1_11 = 8; [L55] unsigned char last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L130] var_1_6 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L131] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L132] var_1_7 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L133] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L134] var_1_8 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L136] var_1_13 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L139] var_1_15 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L142] var_1_16 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L146] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L148] var_1_19 = __VERIFIER_nondet_ulong() [L149] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L149] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L151] var_1_30 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L152] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L154] var_1_32 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L155] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L161] var_1_41 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L162] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_41 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] RET assume_abort_if_not(var_1_41 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L164] var_1_43 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_43 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=1249494912, var_1_9=1] [L165] RET assume_abort_if_not(var_1_43 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=1249494912, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_43 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=1249494912, var_1_9=1] [L166] RET assume_abort_if_not(var_1_43 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=1249494912, var_1_9=1] [L167] var_1_44 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L168] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L169] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L187] RET updateVariables() [L188] CALL step() [L60] COND TRUE \read(var_1_13) [L61] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L65] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L74] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L75] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L79] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_9=1] [L80] COND FALSE !(var_1_18 >= stepLocal_0) [L83] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L85] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L86] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L88] COND TRUE \read(var_1_20) [L89] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L91] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L92] COND FALSE !(((((var_1_9) < (var_1_18)) ? (var_1_9) : (var_1_18))) > var_1_9) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L95] COND FALSE !((var_1_9 <= var_1_14) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L106] COND TRUE var_1_18 > (- var_1_18) [L107] var_1_31 = (var_1_30 && var_1_32) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L109] var_1_33 = var_1_14 [L110] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L111] COND TRUE ((var_1_36 - var_1_37) + var_1_1) == var_1_1 [L112] var_1_35 = var_1_9 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L114] COND FALSE !(var_1_14 >= (~ var_1_18)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L117] COND TRUE \read(var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L118] COND FALSE !(var_1_11 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4294967285, var_1_19=4294967294, var_1_1=2, var_1_20=-255, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=-255, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=-2147483649, var_1_44=-3221225473, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.3s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2342 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2337 mSDsluCounter, 2991 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2005 mSDsCounter, 1580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2594 IncrementalHoareTripleChecker+Invalid, 4175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1580 mSolverCounterUnsat, 986 mSDtfsCounter, 2594 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1165 GetRequests, 1039 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3583 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=4, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 769 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1808 NumberOfCodeBlocks, 1808 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1795 ConstructedInterpolants, 0 QuantifiedInterpolants, 9383 SizeOfPredicates, 7 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 12825/13200 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-11-08 21:35:49,398 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.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 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:35:51,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:35:51,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:35:51,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:35:51,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:35:51,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:35:51,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:35:51,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:35:51,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:35:51,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:35:51,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:35:51,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:35:51,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:35:51,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:35:51,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:35:51,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:35:51,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:35:51,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:35:51,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:35:51,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:35:51,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:35:51,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:35:51,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:35:51,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:35:51,551 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:35:51,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:35:51,551 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:35:51,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:35:51,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:35:51,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:35:51,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:35:51,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:35:51,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:35:51,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:35:51,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:35:51,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:35:51,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:35:51,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:35:51,564 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:35:51,564 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:35:51,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:35:51,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:35:51,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:35:51,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:35:51,566 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 -> 29f3b33aa76fbd79b42fdd0c3fff670150c31cac386cea2ae8894bfbaea7ba77 [2024-11-08 21:35:51,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:35:51,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:35:51,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:35:51,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:35:51,922 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:35:51,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2024-11-08 21:35:53,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:35:53,605 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:35:53,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2024-11-08 21:35:53,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a18f2062/b467c2db9bcc40c290d0943dd7d53fbc/FLAG7ea018826 [2024-11-08 21:35:53,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a18f2062/b467c2db9bcc40c290d0943dd7d53fbc [2024-11-08 21:35:53,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:35:53,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:35:53,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:35:53,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:35:53,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:35:53,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:35:53" (1/1) ... [2024-11-08 21:35:53,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ecf4a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:53, skipping insertion in model container [2024-11-08 21:35:53,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:35:53" (1/1) ... [2024-11-08 21:35:53,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:35:53,864 WARN L250 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-70.i[919,932] [2024-11-08 21:35:53,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:35:53,967 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:35:53,982 WARN L250 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-70.i[919,932] [2024-11-08 21:35:54,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:35:54,063 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:35:54,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54 WrapperNode [2024-11-08 21:35:54,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:35:54,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:35:54,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:35:54,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:35:54,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,125 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-08 21:35:54,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:35:54,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:35:54,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:35:54,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:35:54,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,164 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-11-08 21:35:54,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:35:54,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:35:54,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:35:54,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:35:54,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (1/1) ... [2024-11-08 21:35:54,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:35:54,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:35:54,229 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-11-08 21:35:54,235 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-11-08 21:35:54,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:35:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:35:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:35:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:35:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:35:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:35:54,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:35:54,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:35:59,164 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 21:35:59,165 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:35:59,177 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:35:59,178 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:35:59,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:35:59 BoogieIcfgContainer [2024-11-08 21:35:59,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:35:59,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:35:59,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:35:59,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:35:59,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:35:53" (1/3) ... [2024-11-08 21:35:59,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9d998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:35:59, skipping insertion in model container [2024-11-08 21:35:59,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:54" (2/3) ... [2024-11-08 21:35:59,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9d998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:35:59, skipping insertion in model container [2024-11-08 21:35:59,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:35:59" (3/3) ... [2024-11-08 21:35:59,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-70.i [2024-11-08 21:35:59,203 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:35:59,203 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:35:59,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:35:59,287 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;@4e1b02e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:35:59,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:35:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 21:35:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:35:59,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:59,307 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:35:59,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:59,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash -153865889, now seen corresponding path program 1 times [2024-11-08 21:35:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:35:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482945040] [2024-11-08 21:35:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:59,330 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-11-08 21:35:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:35:59,334 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-11-08 21:35:59,337 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-11-08 21:35:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:59,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:35:59,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 21:36:00,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:36:00,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:36:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482945040] [2024-11-08 21:36:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482945040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:36:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948250296] [2024-11-08 21:36:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:00,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:36:00,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:36:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:36:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:36:00,064 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 53 states have internal predecessors, (75), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:36:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:00,099 INFO L93 Difference]: Finished difference Result 152 states and 267 transitions. [2024-11-08 21:36:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:36:00,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-11-08 21:36:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:00,111 INFO L225 Difference]: With dead ends: 152 [2024-11-08 21:36:00,112 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 21:36:00,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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-11-08 21:36:00,120 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:00,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:36:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 21:36:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-08 21:36:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 21:36:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-11-08 21:36:00,170 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 164 [2024-11-08 21:36:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:00,171 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-11-08 21:36:00,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:36:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-11-08 21:36:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:36:00,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:00,176 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:36:00,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:36:00,376 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-11-08 21:36:00,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:00,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 547198689, now seen corresponding path program 1 times [2024-11-08 21:36:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:36:00,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660528265] [2024-11-08 21:36:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:00,379 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-11-08 21:36:00,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:36:00,381 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-11-08 21:36:00,381 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-11-08 21:36:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:00,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 21:36:00,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-11-08 21:36:05,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:36:05,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:36:05,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660528265] [2024-11-08 21:36:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660528265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:36:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1717692351] [2024-11-08 21:36:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:05,783 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:36:05,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:36:05,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:36:05,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-08 21:36:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:06,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:36:06,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 21:36:06,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:36:06,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1717692351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:06,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:36:06,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-11-08 21:36:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757624932] [2024-11-08 21:36:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:06,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:36:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:36:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:36:06,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:36:06,249 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:36:08,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:36:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:08,356 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2024-11-08 21:36:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:36:08,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-11-08 21:36:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:08,360 INFO L225 Difference]: With dead ends: 216 [2024-11-08 21:36:08,360 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 21:36:08,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:36:08,363 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:08,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 296 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 21:36:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 21:36:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-11-08 21:36:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 21:36:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 215 transitions. [2024-11-08 21:36:08,401 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 215 transitions. Word has length 164 [2024-11-08 21:36:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:08,406 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 215 transitions. [2024-11-08 21:36:08,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:36:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 215 transitions. [2024-11-08 21:36:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:36:08,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:08,412 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:36:08,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-08 21:36:08,628 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-11-08 21:36:08,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-08 21:36:08,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:08,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash -39607325, now seen corresponding path program 1 times [2024-11-08 21:36:08,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:36:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321116257] [2024-11-08 21:36:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:08,816 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-11-08 21:36:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:36:08,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:36:08,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 21:36:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:09,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 21:36:09,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-11-08 21:36:12,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:36:13,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:36:13,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321116257] [2024-11-08 21:36:13,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321116257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:36:13,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2131493786] [2024-11-08 21:36:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:36:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:36:13,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:36:13,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 21:36:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:13,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 21:36:13,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 21:36:13,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:36:13,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2131493786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:13,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:36:13,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-08 21:36:13,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252542523] [2024-11-08 21:36:13,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:13,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:36:13,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:36:13,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:36:13,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:36:13,945 INFO L87 Difference]: Start difference. First operand 142 states and 215 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:36:15,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:36:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:16,077 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2024-11-08 21:36:16,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:36:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2024-11-08 21:36:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:16,081 INFO L225 Difference]: With dead ends: 355 [2024-11-08 21:36:16,082 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 21:36:16,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 21:36:16,085 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 197 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:16,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 466 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 21:36:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 21:36:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 207. [2024-11-08 21:36:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 148 states have internal predecessors, (196), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 21:36:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 308 transitions. [2024-11-08 21:36:16,114 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 308 transitions. Word has length 164 [2024-11-08 21:36:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:16,115 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 308 transitions. [2024-11-08 21:36:16,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 21:36:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 308 transitions. [2024-11-08 21:36:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:36:16,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:16,118 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:36:16,139 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 (5)] Forceful destruction successful, exit code 0 [2024-11-08 21:36:16,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-08 21:36:16,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 21:36:16,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1050724575, now seen corresponding path program 1 times [2024-11-08 21:36:16,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:36:16,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528161110] [2024-11-08 21:36:16,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:16,521 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-11-08 21:36:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:36:16,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:36:16,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 21:36:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:16,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 21:36:16,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-11-08 21:36:20,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:36:21,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:36:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528161110] [2024-11-08 21:36:21,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528161110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:36:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [477343024] [2024-11-08 21:36:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:21,064 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:36:21,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:36:21,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:36:21,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-08 21:36:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:21,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 21:36:21,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-11-08 21:36:24,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:36:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [477343024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:36:24,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:36:24,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-08 21:36:24,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628740754] [2024-11-08 21:36:24,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:36:24,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:36:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:36:24,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:36:24,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-08 21:36:24,932 INFO L87 Difference]: Start difference. First operand 207 states and 308 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 21:36:27,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:36:31,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:36:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:32,880 INFO L93 Difference]: Finished difference Result 583 states and 861 transitions. [2024-11-08 21:36:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 21:36:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2024-11-08 21:36:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:32,887 INFO L225 Difference]: With dead ends: 583 [2024-11-08 21:36:32,887 INFO L226 Difference]: Without dead ends: 379 [2024-11-08 21:36:32,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-11-08 21:36:32,889 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 216 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:32,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 569 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-08 21:36:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-08 21:36:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 341. [2024-11-08 21:36:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 225 states have (on average 1.2844444444444445) internal successors, (289), 228 states have internal predecessors, (289), 106 states have call successors, (106), 9 states have call predecessors, (106), 9 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 21:36:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 501 transitions. [2024-11-08 21:36:32,939 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 501 transitions. Word has length 164 [2024-11-08 21:36:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:32,940 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 501 transitions. [2024-11-08 21:36:32,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 21:36:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 501 transitions. [2024-11-08 21:36:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:36:32,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:32,942 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 21:36:32,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-08 21:36:33,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-08 21:36:33,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 21:36:33,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:33,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:33,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1728551067, now seen corresponding path program 1 times [2024-11-08 21:36:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:36:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473625151] [2024-11-08 21:36:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:33,345 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-11-08 21:36:33,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:36:33,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:36:33,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 21:36:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:33,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:36:33,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-08 21:36:34,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:36:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 21:36:34,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:36:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473625151] [2024-11-08 21:36:34,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473625151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:36:34,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:36:34,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 21:36:34,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669980927] [2024-11-08 21:36:34,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:36:34,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:36:34,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:36:34,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:36:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:36:34,446 INFO L87 Difference]: Start difference. First operand 341 states and 501 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47)