./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-ps-ci_file-11.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 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:50:57,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:50:57,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:50:57,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:50:57,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:50:57,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:50:57,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:50:57,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:50:57,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:50:57,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:50:57,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:50:57,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:50:57,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:50:57,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:50:57,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:50:57,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:50:57,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:50:57,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:50:57,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:50:57,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:50:57,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:50:57,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:50:57,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:50:57,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:50:57,303 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:50:57,303 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:50:57,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:50:57,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:50:57,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:50:57,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:50:57,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:50:57,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:50:57,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:50:57,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:50:57,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:50:57,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:50:57,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:50:57,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:50:57,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:50:57,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:50:57,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:50:57,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:50:57,307 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 -> 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a [2024-11-12 03:50:57,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:50:57,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:50:57,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:50:57,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:50:57,548 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:50:57,549 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-ps-ci_file-11.i [2024-11-12 03:50:58,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:50:59,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:50:59,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-12 03:50:59,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e31ac492/6447288179e546019cbf224362c2716c/FLAG0fb05c2a5 [2024-11-12 03:50:59,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e31ac492/6447288179e546019cbf224362c2716c [2024-11-12 03:50:59,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:50:59,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:50:59,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:50:59,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:50:59,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:50:59,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30aff9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59, skipping insertion in model container [2024-11-12 03:50:59,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:50:59,296 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-ps-ci_file-11.i[919,932] [2024-11-12 03:50:59,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:50:59,385 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:50:59,396 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-ps-ci_file-11.i[919,932] [2024-11-12 03:50:59,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:50:59,467 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:50:59,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59 WrapperNode [2024-11-12 03:50:59,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:50:59,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:50:59,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:50:59,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:50:59,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,529 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-12 03:50:59,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:50:59,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:50:59,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:50:59,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:50:59,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,565 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-12 03:50:59,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:50:59,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:50:59,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:50:59,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:50:59,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (1/1) ... [2024-11-12 03:50:59,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:50:59,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:50:59,625 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-12 03:50:59,628 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-12 03:50:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:50:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:50:59,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:50:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:50:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:50:59,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:50:59,759 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:50:59,762 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:51:00,099 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-12 03:51:00,100 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:51:00,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:51:00,115 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:51:00,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:51:00 BoogieIcfgContainer [2024-11-12 03:51:00,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:51:00,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:51:00,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:51:00,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:51:00,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:50:59" (1/3) ... [2024-11-12 03:51:00,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296308f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:51:00, skipping insertion in model container [2024-11-12 03:51:00,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:59" (2/3) ... [2024-11-12 03:51:00,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296308f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:51:00, skipping insertion in model container [2024-11-12 03:51:00,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:51:00" (3/3) ... [2024-11-12 03:51:00,123 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-12 03:51:00,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:51:00,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:51:00,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:51:00,209 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;@61f91bd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:51:00,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:51:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:51:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 03:51:00,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:00,227 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:00,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:00,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash 110178093, now seen corresponding path program 1 times [2024-11-12 03:51:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:51:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175489905] [2024-11-12 03:51:00,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:51:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:51:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:51:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:51:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:51:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:51:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:51:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:51:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:51:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:51:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:51:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:51:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:51:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:51:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:51:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:51:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:51:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:51:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:51:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:51:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:51:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:51:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:51:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:51:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:51:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:51:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:51:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175489905] [2024-11-12 03:51:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175489905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:51:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:51:01,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:51:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358628231] [2024-11-12 03:51:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:51:01,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:51:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:51:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:51:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:51:01,611 INFO L87 Difference]: Start difference. First operand has 89 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:01,741 INFO L93 Difference]: Finished difference Result 183 states and 318 transitions. [2024-11-12 03:51:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:51:01,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-12 03:51:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:01,752 INFO L225 Difference]: With dead ends: 183 [2024-11-12 03:51:01,753 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 03:51:01,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:51:01,762 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 32 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:01,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 461 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:51:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 03:51:01,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-11-12 03:51:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 63 states have internal predecessors, (91), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:51:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2024-11-12 03:51:01,813 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 157 [2024-11-12 03:51:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:01,816 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-12 03:51:01,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2024-11-12 03:51:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 03:51:01,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:01,821 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:01,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:51:01,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:01,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash 112025135, now seen corresponding path program 1 times [2024-11-12 03:51:01,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:51:01,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720005140] [2024-11-12 03:51:01,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:51:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:51:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:51:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:51:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:51:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:51:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:51:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:51:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:51:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:51:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:51:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:51:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:51:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:51:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:51:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:51:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:51:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:51:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:51:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:51:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:51:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:51:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:51:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:51:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:51:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:51:02,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:51:02,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720005140] [2024-11-12 03:51:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720005140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:51:02,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:51:02,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:51:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169034456] [2024-11-12 03:51:02,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:51:02,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:51:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:51:02,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:51:02,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:51:02,377 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:02,590 INFO L93 Difference]: Finished difference Result 262 states and 412 transitions. [2024-11-12 03:51:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:51:02,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-12 03:51:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:02,593 INFO L225 Difference]: With dead ends: 262 [2024-11-12 03:51:02,596 INFO L226 Difference]: Without dead ends: 176 [2024-11-12 03:51:02,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:51:02,599 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 122 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:02,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 454 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:51:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-12 03:51:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2024-11-12 03:51:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:51:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 243 transitions. [2024-11-12 03:51:02,621 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 243 transitions. Word has length 157 [2024-11-12 03:51:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:02,622 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 243 transitions. [2024-11-12 03:51:02,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2024-11-12 03:51:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 03:51:02,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:02,625 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:02,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:51:02,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:02,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:02,626 INFO L85 PathProgramCache]: Analyzing trace with hash 588459879, now seen corresponding path program 1 times [2024-11-12 03:51:02,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:51:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011984388] [2024-11-12 03:51:02,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:51:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:51:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:51:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:51:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:51:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:51:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:51:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:51:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:51:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:51:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:51:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:51:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:51:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:51:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:51:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:51:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:51:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:51:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:51:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:51:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:51:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:51:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:51:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:51:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:51:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:51:03,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:51:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011984388] [2024-11-12 03:51:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011984388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:51:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134816107] [2024-11-12 03:51:03,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:03,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:51:03,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:51:03,212 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-12 03:51:03,214 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-12 03:51:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:03,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 03:51:03,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:51:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-12 03:51:03,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:51:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:51:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134816107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:51:04,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:51:04,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2024-11-12 03:51:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675469480] [2024-11-12 03:51:04,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:51:04,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 03:51:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:51:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 03:51:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-12 03:51:04,409 INFO L87 Difference]: Start difference. First operand 154 states and 243 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-12 03:51:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:04,631 INFO L93 Difference]: Finished difference Result 264 states and 408 transitions. [2024-11-12 03:51:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 03:51:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 158 [2024-11-12 03:51:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:04,638 INFO L225 Difference]: With dead ends: 264 [2024-11-12 03:51:04,638 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 03:51:04,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-12 03:51:04,640 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 332 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:04,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 308 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:51:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 03:51:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2024-11-12 03:51:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:51:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2024-11-12 03:51:04,662 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 158 [2024-11-12 03:51:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:04,663 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2024-11-12 03:51:04,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-12 03:51:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2024-11-12 03:51:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 03:51:04,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:04,665 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:04,680 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-12 03:51:04,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:51:04,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:04,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1737674632, now seen corresponding path program 1 times [2024-11-12 03:51:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:51:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202649621] [2024-11-12 03:51:04,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:04,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:51:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:51:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:51:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:51:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:51:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:51:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:51:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:51:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:51:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:51:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:51:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:51:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:51:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:51:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:51:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:51:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:51:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:51:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:51:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:51:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:51:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:51:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:51:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:51:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:51:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:51:05,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:51:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202649621] [2024-11-12 03:51:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202649621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:51:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:51:05,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:51:05,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999149075] [2024-11-12 03:51:05,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:51:05,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:51:05,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:51:05,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:51:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:51:05,413 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:51:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:05,975 INFO L93 Difference]: Finished difference Result 564 states and 788 transitions. [2024-11-12 03:51:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 03:51:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-12 03:51:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:05,978 INFO L225 Difference]: With dead ends: 564 [2024-11-12 03:51:05,978 INFO L226 Difference]: Without dead ends: 478 [2024-11-12 03:51:05,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:51:05,980 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 612 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:05,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 346 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:51:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-12 03:51:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 400. [2024-11-12 03:51:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 296 states have (on average 1.3445945945945945) internal successors, (398), 300 states have internal predecessors, (398), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-12 03:51:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 574 transitions. [2024-11-12 03:51:06,033 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 574 transitions. Word has length 159 [2024-11-12 03:51:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:06,033 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 574 transitions. [2024-11-12 03:51:06,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:51:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 574 transitions. [2024-11-12 03:51:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 03:51:06,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:06,035 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:06,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:51:06,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:06,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1739521674, now seen corresponding path program 1 times [2024-11-12 03:51:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:51:06,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644368356] [2024-11-12 03:51:06,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:51:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:51:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:51:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:51:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:51:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:51:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:51:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:51:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:51:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:51:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:51:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:51:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:51:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:51:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:51:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:51:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:51:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:51:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:51:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:51:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:51:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:51:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:51:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:51:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:51:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:51:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:51:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644368356] [2024-11-12 03:51:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644368356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:51:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990310528] [2024-11-12 03:51:06,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:06,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:51:06,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:51:06,457 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-12 03:51:06,459 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-12 03:51:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:06,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 03:51:06,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:51:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 465 proven. 18 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-12 03:51:06,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:51:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 51 proven. 18 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:51:07,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990310528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:51:07,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:51:07,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2024-11-12 03:51:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108879773] [2024-11-12 03:51:07,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:51:07,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 03:51:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:51:07,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 03:51:07,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-12 03:51:07,174 INFO L87 Difference]: Start difference. First operand 400 states and 574 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-12 03:51:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:08,917 INFO L93 Difference]: Finished difference Result 1441 states and 1987 transitions. [2024-11-12 03:51:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-12 03:51:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) Word has length 159 [2024-11-12 03:51:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:08,925 INFO L225 Difference]: With dead ends: 1441 [2024-11-12 03:51:08,927 INFO L226 Difference]: Without dead ends: 1133 [2024-11-12 03:51:08,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=591, Invalid=2379, Unknown=0, NotChecked=0, Total=2970 [2024-11-12 03:51:08,929 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 945 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:08,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 905 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 03:51:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-12 03:51:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 814. [2024-11-12 03:51:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 615 states have (on average 1.338211382113821) internal successors, (823), 627 states have internal predecessors, (823), 161 states have call successors, (161), 37 states have call predecessors, (161), 37 states have return successors, (161), 149 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-12 03:51:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1145 transitions. [2024-11-12 03:51:09,021 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1145 transitions. Word has length 159 [2024-11-12 03:51:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:09,022 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1145 transitions. [2024-11-12 03:51:09,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-12 03:51:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1145 transitions. [2024-11-12 03:51:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 03:51:09,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:09,025 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:09,039 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-12 03:51:09,229 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-12 03:51:09,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:09,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2097654279, now seen corresponding path program 1 times [2024-11-12 03:51:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:51:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569870997] [2024-11-12 03:51:09,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:51:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:51:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:51:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:51:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:51:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:51:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:51:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:51:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:51:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:51:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:51:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:51:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:51:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:51:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:51:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:51:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:51:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:51:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:51:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:51:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:51:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:51:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:51:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:51:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:51:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 60 proven. 72 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-12 03:51:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:51:11,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569870997] [2024-11-12 03:51:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569870997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:51:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896008457] [2024-11-12 03:51:11,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:11,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:51:11,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:51:11,529 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-12 03:51:11,531 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-12 03:51:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:11,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 03:51:11,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:51:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 726 proven. 69 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-12 03:51:12,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:51:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-12 03:51:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896008457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:51:12,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:51:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 32 [2024-11-12 03:51:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792364968] [2024-11-12 03:51:12,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:51:12,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 03:51:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:51:12,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 03:51:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2024-11-12 03:51:12,846 INFO L87 Difference]: Start difference. First operand 814 states and 1145 transitions. Second operand has 32 states, 32 states have (on average 3.90625) internal successors, (125), 31 states have internal predecessors, (125), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 10 states have call predecessors, (72), 9 states have call successors, (72) [2024-11-12 03:51:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:17,199 INFO L93 Difference]: Finished difference Result 2058 states and 2831 transitions. [2024-11-12 03:51:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-12 03:51:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.90625) internal successors, (125), 31 states have internal predecessors, (125), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 10 states have call predecessors, (72), 9 states have call successors, (72) Word has length 160 [2024-11-12 03:51:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:17,206 INFO L225 Difference]: With dead ends: 2058 [2024-11-12 03:51:17,206 INFO L226 Difference]: Without dead ends: 1350 [2024-11-12 03:51:17,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1108, Invalid=4744, Unknown=0, NotChecked=0, Total=5852 [2024-11-12 03:51:17,210 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1493 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:17,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1030 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 03:51:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-11-12 03:51:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1007. [2024-11-12 03:51:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 756 states have (on average 1.3174603174603174) internal successors, (996), 771 states have internal predecessors, (996), 199 states have call successors, (199), 51 states have call predecessors, (199), 51 states have return successors, (199), 184 states have call predecessors, (199), 199 states have call successors, (199) [2024-11-12 03:51:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1394 transitions. [2024-11-12 03:51:17,305 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1394 transitions. Word has length 160 [2024-11-12 03:51:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:17,305 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1394 transitions. [2024-11-12 03:51:17,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.90625) internal successors, (125), 31 states have internal predecessors, (125), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 10 states have call predecessors, (72), 9 states have call successors, (72) [2024-11-12 03:51:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1394 transitions. [2024-11-12 03:51:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 03:51:17,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:17,307 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:17,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 03:51:17,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:51:17,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:17,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash -452636203, now seen corresponding path program 1 times [2024-11-12 03:51:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:51:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506050822] [2024-11-12 03:51:17,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:51:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:51:17,568 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:51:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:51:17,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:51:17,708 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:51:17,709 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:51:17,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 03:51:17,714 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:51:17,830 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:51:17,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:51:17 BoogieIcfgContainer [2024-11-12 03:51:17,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:51:17,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:51:17,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:51:17,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:51:17,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:51:00" (3/4) ... [2024-11-12 03:51:17,838 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:51:17,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:51:17,840 INFO L158 Benchmark]: Toolchain (without parser) took 18741.51ms. Allocated memory was 205.5MB in the beginning and 461.4MB in the end (delta: 255.9MB). Free memory was 174.1MB in the beginning and 242.2MB in the end (delta: -68.0MB). Peak memory consumption was 188.5MB. Max. memory is 16.1GB. [2024-11-12 03:51:17,840 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:51:17,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.32ms. Allocated memory is still 205.5MB. Free memory was 174.1MB in the beginning and 157.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:51:17,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.88ms. Allocated memory is still 205.5MB. Free memory was 157.4MB in the beginning and 154.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 03:51:17,841 INFO L158 Benchmark]: Boogie Preprocessor took 52.31ms. Allocated memory is still 205.5MB. Free memory was 154.9MB in the beginning and 151.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:51:17,841 INFO L158 Benchmark]: RCFGBuilder took 530.27ms. Allocated memory is still 205.5MB. Free memory was 151.2MB in the beginning and 128.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 03:51:17,841 INFO L158 Benchmark]: TraceAbstraction took 17717.05ms. Allocated memory was 205.5MB in the beginning and 461.4MB in the end (delta: 255.9MB). Free memory was 127.7MB in the beginning and 243.2MB in the end (delta: -115.6MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2024-11-12 03:51:17,841 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 461.4MB. Free memory was 243.2MB in the beginning and 242.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 03:51:17,842 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.32ms. Allocated memory is still 205.5MB. Free memory was 174.1MB in the beginning and 157.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.88ms. Allocated memory is still 205.5MB. Free memory was 157.4MB in the beginning and 154.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.31ms. Allocated memory is still 205.5MB. Free memory was 154.9MB in the beginning and 151.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 530.27ms. Allocated memory is still 205.5MB. Free memory was 151.2MB in the beginning and 128.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17717.05ms. Allocated memory was 205.5MB in the beginning and 461.4MB in the end (delta: 255.9MB). Free memory was 127.7MB in the beginning and 243.2MB in the end (delta: -115.6MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 461.4MB. Free memory was 243.2MB in the beginning and 242.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someUnaryDOUBLEoperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] unsigned char var_1_25 = 10; [L42] unsigned char var_1_27 = 128; [L43] float var_1_30 = 31.3; [L44] float var_1_32 = 15.25; [L45] double var_1_33 = 128.8; [L46] signed char var_1_34 = 4; [L47] signed char var_1_35 = 1; [L48] unsigned char var_1_36 = 16; [L49] unsigned long int last_1_var_1_10 = 128; [L50] unsigned long int last_1_var_1_16 = 1; [L51] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] CALL updateLastVariables() [L179] last_1_var_1_10 = var_1_10 [L180] last_1_var_1_16 = var_1_16 [L181] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] var_1_7 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L148] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L149] var_1_8 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L150] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L151] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=4] [L152] var_1_9 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L153] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L154] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L155] var_1_11 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L156] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L157] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L158] var_1_17 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L159] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L160] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L161] var_1_18 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L162] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L163] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L167] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L168] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L169] var_1_32 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L170] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L171] var_1_34 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L173] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L174] var_1_35 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L175] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L176] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L192] RET updateVariables() [L193] CALL step() [L55] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L56] COND FALSE !(var_1_7 > var_1_12) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L63] EXPR var_1_12 >> var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L63] EXPR ((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L63] COND FALSE !(var_1_18 <= ((((var_1_9) < ((var_1_12 >> var_1_7))) ? (var_1_9) : ((var_1_12 >> var_1_7))))) [L66] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L70] COND TRUE \read(var_1_1) [L71] var_1_30 = ((((var_1_20) < ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32)))))) ? (var_1_20) : ((1.625f + ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L73] COND FALSE !(var_1_9 >= var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L86] COND TRUE var_1_27 >= (var_1_9 + var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L87] COND TRUE (-0.95f * ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > var_1_20 [L88] var_1_36 = (var_1_27 - var_1_35) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L97] unsigned long int stepLocal_1 = last_1_var_1_16; [L98] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L99] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L100] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=63, var_1_9=0] [L108] COND TRUE var_1_12 == var_1_12 [L109] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=19/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L111] var_1_1 = (var_1_2 || (! var_1_3)) [L112] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L113] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L114] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L115] COND FALSE !(var_1_19 >= var_1_19) [L120] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L125] COND TRUE var_1_19 != var_1_19 [L126] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L134] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L135] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L136] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=63, var_1_17=-4611686009837453314, var_1_18=-4611686007689969665, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=0, var_1_30=7/5, var_1_33=644/5, var_1_34=0, var_1_35=4, var_1_36=250, var_1_3=0, var_1_4=71, var_1_7=0, var_1_8=63, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3586 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3536 mSDsluCounter, 3504 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2893 mSDsCounter, 1212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3858 IncrementalHoareTripleChecker+Invalid, 5070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1212 mSolverCounterUnsat, 611 mSDtfsCounter, 3858 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1394 GetRequests, 1232 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2431 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1007occurred in iteration=6, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 778 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1892 ConstructedInterpolants, 0 QuantifiedInterpolants, 10128 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1151 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 12792/13248 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-12 03:51:17,873 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-ps-ci_file-11.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 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:51:19,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:51:20,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:51:20,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:51:20,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:51:20,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:51:20,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:51:20,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:51:20,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:51:20,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:51:20,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:51:20,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:51:20,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:51:20,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:51:20,064 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:51:20,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:51:20,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:51:20,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:51:20,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:51:20,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:51:20,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:51:20,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:51:20,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:51:20,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:51:20,067 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:51:20,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:51:20,068 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:51:20,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:51:20,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:51:20,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:51:20,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:51:20,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:51:20,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:51:20,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:51:20,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:51:20,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:51:20,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:51:20,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:51:20,072 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:51:20,073 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:51:20,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:51:20,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:51:20,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:51:20,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:51:20,074 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 -> 24ca5306f015ab172719330a0597265b0f70dab4b133299f4b32574bb8d8923a [2024-11-12 03:51:20,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:51:20,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:51:20,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:51:20,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:51:20,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:51:20,383 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-ps-ci_file-11.i [2024-11-12 03:51:21,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:51:22,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:51:22,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-12 03:51:22,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367a87a75/ec4ef428638443adb27edcffbda9b8db/FLAG505ee4138 [2024-11-12 03:51:22,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367a87a75/ec4ef428638443adb27edcffbda9b8db [2024-11-12 03:51:22,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:51:22,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:51:22,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:51:22,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:51:22,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:51:22,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46208908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22, skipping insertion in model container [2024-11-12 03:51:22,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:51:22,300 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-ps-ci_file-11.i[919,932] [2024-11-12 03:51:22,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:51:22,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:51:22,416 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-ps-ci_file-11.i[919,932] [2024-11-12 03:51:22,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:51:22,477 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:51:22,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22 WrapperNode [2024-11-12 03:51:22,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:51:22,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:51:22,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:51:22,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:51:22,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,524 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-12 03:51:22,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:51:22,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:51:22,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:51:22,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:51:22,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,555 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-12 03:51:22,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:51:22,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:51:22,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:51:22,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:51:22,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (1/1) ... [2024-11-12 03:51:22,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:51:22,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:51:22,633 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-12 03:51:22,636 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-12 03:51:22,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:51:22,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:51:22,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:51:22,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:51:22,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:51:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:51:22,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:51:22,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:51:24,602 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 03:51:24,602 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:51:24,616 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:51:24,617 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:51:24,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:51:24 BoogieIcfgContainer [2024-11-12 03:51:24,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:51:24,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:51:24,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:51:24,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:51:24,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:51:22" (1/3) ... [2024-11-12 03:51:24,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ae581a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:51:24, skipping insertion in model container [2024-11-12 03:51:24,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:51:22" (2/3) ... [2024-11-12 03:51:24,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ae581a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:51:24, skipping insertion in model container [2024-11-12 03:51:24,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:51:24" (3/3) ... [2024-11-12 03:51:24,623 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-11.i [2024-11-12 03:51:24,637 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:51:24,637 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:51:24,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:51:24,701 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;@727f0279, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:51:24,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:51:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:51:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 03:51:24,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:24,719 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:24,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:24,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 898373128, now seen corresponding path program 1 times [2024-11-12 03:51:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:51:24,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472716280] [2024-11-12 03:51:24,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:24,737 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-12 03:51:24,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:51:24,740 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-12 03:51:24,765 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-12 03:51:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:25,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:51:25,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:51:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-12 03:51:25,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:51:25,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:51:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472716280] [2024-11-12 03:51:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472716280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:51:25,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:51:25,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:51:25,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485399049] [2024-11-12 03:51:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:51:25,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:51:25,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:51:25,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:51:25,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:51:25,082 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:51:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:25,104 INFO L93 Difference]: Finished difference Result 155 states and 276 transitions. [2024-11-12 03:51:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:51:25,106 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 155 [2024-11-12 03:51:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:25,112 INFO L225 Difference]: With dead ends: 155 [2024-11-12 03:51:25,112 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 03:51:25,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-12 03:51:25,117 INFO L435 NwaCegarLoop]: 120 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, 120 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-12 03:51:25,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:51:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 03:51:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-12 03:51:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:51:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-11-12 03:51:25,154 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 155 [2024-11-12 03:51:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:25,155 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-11-12 03:51:25,156 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:51:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-11-12 03:51:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 03:51:25,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:25,159 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:25,166 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-12 03:51:25,362 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-12 03:51:25,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:25,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -999648376, now seen corresponding path program 1 times [2024-11-12 03:51:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:51:25,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247845100] [2024-11-12 03:51:25,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:25,365 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-12 03:51:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:51:25,368 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-12 03:51:25,369 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-12 03:51:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:25,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 03:51:25,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:51:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:51:26,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:51:26,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:51:26,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247845100] [2024-11-12 03:51:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247845100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:51:26,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:51:26,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:51:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719198459] [2024-11-12 03:51:26,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:51:26,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:51:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:51:26,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:51:26,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:51:26,052 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:27,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:51:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:28,069 INFO L93 Difference]: Finished difference Result 212 states and 335 transitions. [2024-11-12 03:51:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:51:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-12 03:51:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:28,087 INFO L225 Difference]: With dead ends: 212 [2024-11-12 03:51:28,087 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 03:51:28,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 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-12 03:51:28,089 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 28 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:28,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 229 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 03:51:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 03:51:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2024-11-12 03:51:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:51:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 194 transitions. [2024-11-12 03:51:28,107 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 194 transitions. Word has length 155 [2024-11-12 03:51:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:28,108 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 194 transitions. [2024-11-12 03:51:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 194 transitions. [2024-11-12 03:51:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 03:51:28,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:28,110 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:28,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 03:51:28,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:51:28,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:28,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash 280215302, now seen corresponding path program 1 times [2024-11-12 03:51:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:51:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228571546] [2024-11-12 03:51:28,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:28,313 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-12 03:51:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:51:28,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:51:28,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 03:51:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:28,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:51:28,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:51:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:51:29,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:51:29,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:51:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228571546] [2024-11-12 03:51:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228571546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:51:29,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:51:29,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:51:29,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286352038] [2024-11-12 03:51:29,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:51:29,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:51:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:51:29,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:51:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:51:29,372 INFO L87 Difference]: Start difference. First operand 125 states and 194 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:29,768 INFO L93 Difference]: Finished difference Result 226 states and 354 transitions. [2024-11-12 03:51:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:51:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-12 03:51:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:29,776 INFO L225 Difference]: With dead ends: 226 [2024-11-12 03:51:29,776 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 03:51:29,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:51:29,777 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:29,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 402 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:51:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 03:51:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2024-11-12 03:51:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:51:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 210 transitions. [2024-11-12 03:51:29,813 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 210 transitions. Word has length 155 [2024-11-12 03:51:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:29,813 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 210 transitions. [2024-11-12 03:51:29,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 210 transitions. [2024-11-12 03:51:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 03:51:29,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:29,815 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:29,824 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 (4)] Forceful destruction successful, exit code 0 [2024-11-12 03:51:30,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:51:30,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:30,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1562798992, now seen corresponding path program 1 times [2024-11-12 03:51:30,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:51:30,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892916866] [2024-11-12 03:51:30,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:30,019 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-12 03:51:30,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:51:30,038 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-12 03:51:30,040 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-12 03:51:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:30,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 03:51:30,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:51:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-12 03:51:30,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:51:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:51:30,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:51:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892916866] [2024-11-12 03:51:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892916866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:51:30,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:51:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-12 03:51:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861367623] [2024-11-12 03:51:30,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:51:30,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 03:51:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:51:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 03:51:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 03:51:30,949 INFO L87 Difference]: Start difference. First operand 134 states and 210 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-12 03:51:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:32,447 INFO L93 Difference]: Finished difference Result 234 states and 358 transitions. [2024-11-12 03:51:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 03:51:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 156 [2024-11-12 03:51:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:32,450 INFO L225 Difference]: With dead ends: 234 [2024-11-12 03:51:32,450 INFO L226 Difference]: Without dead ends: 150 [2024-11-12 03:51:32,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-12 03:51:32,451 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 120 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:32,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 03:51:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-12 03:51:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 142. [2024-11-12 03:51:32,496 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), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:51:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 211 transitions. [2024-11-12 03:51:32,498 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 211 transitions. Word has length 156 [2024-11-12 03:51:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:32,498 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 211 transitions. [2024-11-12 03:51:32,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-12 03:51:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 211 transitions. [2024-11-12 03:51:32,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 03:51:32,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:32,501 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:32,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 03:51:32,701 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 [2024-11-12 03:51:32,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:32,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1934674337, now seen corresponding path program 1 times [2024-11-12 03:51:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:51:32,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119465724] [2024-11-12 03:51:32,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:32,703 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-12 03:51:32,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:51:32,705 INFO L229 MonitoredProcess]: Starting monitored process 6 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-12 03:51:32,706 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 (6)] Waiting until timeout for monitored process [2024-11-12 03:51:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:32,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 03:51:32,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:51:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:51:33,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:51:33,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:51:33,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119465724] [2024-11-12 03:51:33,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119465724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:51:33,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:51:33,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:51:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184374501] [2024-11-12 03:51:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:51:33,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:51:33,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:51:33,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:51:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:51:33,321 INFO L87 Difference]: Start difference. First operand 142 states and 211 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:37,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:51:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:51:38,538 INFO L93 Difference]: Finished difference Result 224 states and 333 transitions. [2024-11-12 03:51:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:51:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-12 03:51:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:51:38,540 INFO L225 Difference]: With dead ends: 224 [2024-11-12 03:51:38,540 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 03:51:38,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:51:38,541 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 96 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:51:38,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 266 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-12 03:51:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 03:51:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-11-12 03:51:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 89 states have internal predecessors, (112), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:51:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-11-12 03:51:38,563 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 157 [2024-11-12 03:51:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:51:38,564 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-11-12 03:51:38,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:51:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-11-12 03:51:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 03:51:38,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:51:38,566 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:51:38,575 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 (6)] Ended with exit code 0 [2024-11-12 03:51:38,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-12 03:51:38,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:51:38,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:51:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1624509410, now seen corresponding path program 1 times [2024-11-12 03:51:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:51:38,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975925193] [2024-11-12 03:51:38,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:51:38,768 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-12 03:51:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:51:38,770 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-12 03:51:38,771 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-12 03:51:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:51:38,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 03:51:38,950 INFO L279 TraceCheckSpWp]: Computing forward predicates...