./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:24:37,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:24:37,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:24:37,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:24:37,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:24:37,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:24:37,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:24:37,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:24:37,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:24:37,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:24:37,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:24:37,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:24:37,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:24:37,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:24:37,139 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:24:37,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:24:37,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:24:37,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:24:37,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:24:37,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:24:37,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:24:37,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:24:37,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:24:37,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:24:37,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:24:37,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:24:37,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:24:37,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:24:37,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:24:37,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:24:37,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:24:37,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:24:37,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:37,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:24:37,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:24:37,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:24:37,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:24:37,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:24:37,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:24:37,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:24:37,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:24:37,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:24:37,153 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2024-10-24 06:24:37,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:24:37,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:24:37,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:24:37,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:24:37,442 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:24:37,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-10-24 06:24:39,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:24:39,721 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:24:39,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-10-24 06:24:39,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa60abe35/79a967564ac04efa9ba864478fb7c58d/FLAGa4b428e86 [2024-10-24 06:24:39,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa60abe35/79a967564ac04efa9ba864478fb7c58d [2024-10-24 06:24:39,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:24:39,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:24:39,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:39,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:24:39,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:24:39,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:39" (1/1) ... [2024-10-24 06:24:39,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddd3340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:39, skipping insertion in model container [2024-10-24 06:24:39,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:39" (1/1) ... [2024-10-24 06:24:39,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:24:39,959 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-10-24 06:24:40,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:40,049 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:24:40,093 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-10-24 06:24:40,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:40,204 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:24:40,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40 WrapperNode [2024-10-24 06:24:40,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:40,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:40,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:24:40,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:24:40,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,295 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-24 06:24:40,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:40,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:24:40,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:24:40,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:24:40,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,348 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:24:40,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:24:40,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:24:40,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:24:40,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:24:40,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (1/1) ... [2024-10-24 06:24:40,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:40,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:24:40,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:24:40,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:24:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:24:40,550 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:24:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:24:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:24:40,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:24:40,693 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:24:40,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:24:41,045 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 06:24:41,045 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:24:41,084 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:24:41,085 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:24:41,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:41 BoogieIcfgContainer [2024-10-24 06:24:41,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:24:41,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:24:41,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:24:41,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:24:41,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:24:39" (1/3) ... [2024-10-24 06:24:41,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4a92c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:41, skipping insertion in model container [2024-10-24 06:24:41,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:40" (2/3) ... [2024-10-24 06:24:41,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4a92c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:41, skipping insertion in model container [2024-10-24 06:24:41,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:41" (3/3) ... [2024-10-24 06:24:41,093 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-10-24 06:24:41,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:24:41,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:24:41,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:24:41,170 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;@41555de5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:24:41,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:24:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 06:24:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 06:24:41,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:41,190 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:41,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:41,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:41,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1708784069, now seen corresponding path program 1 times [2024-10-24 06:24:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332502903] [2024-10-24 06:24:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:24:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:24:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:24:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:24:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 06:24:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:24:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 06:24:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:24:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:24:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:24:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:24:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:24:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:24:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:24:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:24:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:24:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:24:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:24:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:24:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 06:24:41,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:41,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332502903] [2024-10-24 06:24:41,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332502903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:41,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:41,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:24:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330762514] [2024-10-24 06:24:41,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:41,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:24:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:41,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:24:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:24:41,760 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 06:24:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:41,877 INFO L93 Difference]: Finished difference Result 131 states and 233 transitions. [2024-10-24 06:24:41,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:24:41,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-10-24 06:24:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:41,889 INFO L225 Difference]: With dead ends: 131 [2024-10-24 06:24:41,890 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 06:24:41,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:24:41,898 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:41,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:24:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 06:24:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-24 06:24:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 06:24:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 100 transitions. [2024-10-24 06:24:41,947 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 100 transitions. Word has length 147 [2024-10-24 06:24:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:41,948 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 100 transitions. [2024-10-24 06:24:41,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 06:24:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2024-10-24 06:24:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 06:24:41,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:41,955 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:41,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:24:41,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:41,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash -887805817, now seen corresponding path program 1 times [2024-10-24 06:24:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:41,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722679565] [2024-10-24 06:24:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:24:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:24:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:24:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:24:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 06:24:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:24:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 06:24:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:24:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:24:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:24:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:24:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:24:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:24:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:24:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:24:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:24:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:24:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:24:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:24:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 06:24:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722679565] [2024-10-24 06:24:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722679565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:24:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981042751] [2024-10-24 06:24:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:42,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:24:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:42,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:24:42,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:42,220 INFO L87 Difference]: Start difference. First operand 65 states and 100 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 06:24:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:42,244 INFO L93 Difference]: Finished difference Result 129 states and 199 transitions. [2024-10-24 06:24:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:24:42,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-10-24 06:24:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:42,247 INFO L225 Difference]: With dead ends: 129 [2024-10-24 06:24:42,247 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 06:24:42,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:42,249 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:42,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:24:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 06:24:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-24 06:24:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 06:24:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2024-10-24 06:24:42,257 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 148 [2024-10-24 06:24:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:42,258 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2024-10-24 06:24:42,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 06:24:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2024-10-24 06:24:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 06:24:42,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:42,260 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:42,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:24:42,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:42,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash 887201545, now seen corresponding path program 1 times [2024-10-24 06:24:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:42,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42776501] [2024-10-24 06:24:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:24:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:24:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:24:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:24:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:24:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:24:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:24:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:24:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 06:24:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 06:24:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 06:24:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 06:24:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:24:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 06:24:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:24:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 06:24:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:24:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:24:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:24:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:24:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:24:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:24:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 06:24:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 06:24:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:24:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42776501] [2024-10-24 06:24:43,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42776501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:43,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:43,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:24:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650792230] [2024-10-24 06:24:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:43,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:24:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:24:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:24:43,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:24:43,162 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 06:24:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:43,561 INFO L93 Difference]: Finished difference Result 204 states and 301 transitions. [2024-10-24 06:24:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:24:43,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-10-24 06:24:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:43,567 INFO L225 Difference]: With dead ends: 204 [2024-10-24 06:24:43,568 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 06:24:43,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:24:43,572 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 87 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:43,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 327 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:24:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 06:24:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2024-10-24 06:24:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 62 states have internal predecessors, (79), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 06:24:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2024-10-24 06:24:43,612 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 148 [2024-10-24 06:24:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:43,613 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2024-10-24 06:24:43,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 06:24:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2024-10-24 06:24:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 06:24:43,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:43,623 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:43,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:24:43,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:43,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 887261127, now seen corresponding path program 1 times [2024-10-24 06:24:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:24:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744307418] [2024-10-24 06:24:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:24:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:24:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795559296] [2024-10-24 06:24:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:43,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:24:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:43,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:24:43,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:24:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:24:43,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:24:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:24:44,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:24:44,070 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:24:44,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:24:44,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:24:44,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:24:44,278 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 06:24:44,418 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:24:44,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:24:44 BoogieIcfgContainer [2024-10-24 06:24:44,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:24:44,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:24:44,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:24:44,426 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:24:44,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:41" (3/4) ... [2024-10-24 06:24:44,429 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:24:44,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:24:44,432 INFO L158 Benchmark]: Toolchain (without parser) took 4675.40ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 102.6MB in the beginning and 227.7MB in the end (delta: -125.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:24:44,435 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:24:44,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.37ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 102.3MB in the beginning and 240.8MB in the end (delta: -138.5MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-24 06:24:44,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.37ms. Allocated memory is still 272.6MB. Free memory was 240.8MB in the beginning and 236.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:24:44,436 INFO L158 Benchmark]: Boogie Preprocessor took 102.92ms. Allocated memory is still 272.6MB. Free memory was 236.6MB in the beginning and 229.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 06:24:44,436 INFO L158 Benchmark]: RCFGBuilder took 685.86ms. Allocated memory is still 272.6MB. Free memory was 229.3MB in the beginning and 198.9MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 06:24:44,437 INFO L158 Benchmark]: TraceAbstraction took 3337.59ms. Allocated memory is still 272.6MB. Free memory was 197.8MB in the beginning and 227.7MB in the end (delta: -29.9MB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. [2024-10-24 06:24:44,437 INFO L158 Benchmark]: Witness Printer took 4.89ms. Allocated memory is still 272.6MB. Free memory is still 227.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:24:44,438 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.18ms. Allocated memory is still 176.2MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.37ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 102.3MB in the beginning and 240.8MB in the end (delta: -138.5MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.37ms. Allocated memory is still 272.6MB. Free memory was 240.8MB in the beginning and 236.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.92ms. Allocated memory is still 272.6MB. Free memory was 236.6MB in the beginning and 229.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 685.86ms. Allocated memory is still 272.6MB. Free memory was 229.3MB in the beginning and 198.9MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3337.59ms. Allocated memory is still 272.6MB. Free memory was 197.8MB in the beginning and 227.7MB in the end (delta: -29.9MB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. * Witness Printer took 4.89ms. Allocated memory is still 272.6MB. Free memory is still 227.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] float var_1_31 = 127.75; [L42] float var_1_32 = 15.5; [L43] unsigned long int var_1_33 = 16; [L44] signed long int var_1_34 = 256; [L45] unsigned char var_1_35 = 0; [L46] signed short int var_1_36 = 8; [L47] signed long int var_1_37 = 256; [L48] unsigned long int var_1_38 = 500; [L49] unsigned char last_1_var_1_9 = 1; [L50] float last_1_var_1_24 = 128.5; [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L153] last_1_var_1_9 = var_1_9 [L154] last_1_var_1_24 = var_1_24 [L164] RET updateLastVariables() [L165] CALL updateVariables() [L116] var_1_4 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L117] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L118] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L119] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=5, var_1_9=1] [L120] var_1_8 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_9=1] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L123] var_1_10 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L126] var_1_11 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L127] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] 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_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L133] 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_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L134] var_1_28 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L137] var_1_29 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L140] var_1_32 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L142] var_1_35 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L145] var_1_36 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_36 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_36 >= -1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L148] var_1_37 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_37 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_37 >= -2147483647) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_37 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_37 <= 2147483646) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L55] COND TRUE -32 <= var_1_28 [L56] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L58] var_1_31 = var_1_32 [L59] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L60] COND FALSE !(var_1_31 > var_1_32) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L65] COND TRUE ((var_1_36 - var_1_29) * var_1_27) > var_1_28 [L66] var_1_34 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=-9, var_1_8=0, var_1_9=1] [L71] COND FALSE !(var_1_34 < var_1_37) [L74] var_1_38 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=1] [L76] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L83] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=1] [L85] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=1] [L86] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L87] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L89] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L90] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L93] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L95] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L96] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L99] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L103] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L104] var_1_25 = var_1_20 [L105] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=3, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=3, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L106] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L107] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=3, var_1_17=127/5, var_1_1=3, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L111] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=3, var_1_17=127/5, var_1_1=3, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=3, var_1_17=127/5, var_1_1=3, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=3, var_1_15=3, var_1_16=3, var_1_17=127/5, var_1_1=3, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=3, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=-9, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 611 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 303 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 44 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3036/3036 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:24:44,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:24:47,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:24:47,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:24:47,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:24:47,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:24:47,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:24:47,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:24:47,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:24:47,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:24:47,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:24:47,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:24:47,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:24:47,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:24:47,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:24:47,395 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:24:47,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:24:47,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:24:47,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:24:47,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:24:47,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:24:47,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:24:47,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:24:47,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:24:47,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:24:47,402 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:24:47,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:24:47,403 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:24:47,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:24:47,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:24:47,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:24:47,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:24:47,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:24:47,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:24:47,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:24:47,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:47,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:24:47,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:24:47,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:24:47,407 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:24:47,407 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:24:47,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:24:47,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:24:47,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:24:47,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:24:47,408 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:24:47,409 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2024-10-24 06:24:47,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:24:47,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:24:47,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:24:47,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:24:47,902 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:24:47,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-10-24 06:24:49,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:24:49,918 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:24:49,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-10-24 06:24:49,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87f3f074/f7a9d41192d3475d9384bd68326699a5/FLAG7f96fc6ce [2024-10-24 06:24:49,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f87f3f074/f7a9d41192d3475d9384bd68326699a5 [2024-10-24 06:24:49,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:24:49,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:24:49,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:49,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:24:49,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:24:49,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:49" (1/1) ... [2024-10-24 06:24:49,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bf99ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:49, skipping insertion in model container [2024-10-24 06:24:49,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:24:49" (1/1) ... [2024-10-24 06:24:50,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:24:50,219 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-10-24 06:24:50,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:50,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:24:50,353 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-10-24 06:24:50,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:24:50,416 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:24:50,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50 WrapperNode [2024-10-24 06:24:50,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:24:50,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:50,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:24:50,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:24:50,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,481 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-10-24 06:24:50,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:24:50,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:24:50,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:24:50,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:24:50,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,529 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:24:50,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:24:50,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:24:50,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:24:50,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:24:50,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (1/1) ... [2024-10-24 06:24:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:24:50,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:24:50,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:24:50,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:24:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:24:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:24:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:24:50,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:24:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:24:50,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:24:50,863 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:24:50,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:24:51,680 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 06:24:51,680 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:24:51,757 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:24:51,758 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:24:51,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:51 BoogieIcfgContainer [2024-10-24 06:24:51,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:24:51,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:24:51,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:24:51,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:24:51,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:24:49" (1/3) ... [2024-10-24 06:24:51,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5154c246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:51, skipping insertion in model container [2024-10-24 06:24:51,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:24:50" (2/3) ... [2024-10-24 06:24:51,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5154c246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:24:51, skipping insertion in model container [2024-10-24 06:24:51,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:24:51" (3/3) ... [2024-10-24 06:24:51,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-10-24 06:24:51,787 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:24:51,788 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:24:51,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:24:51,873 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;@765414e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:24:51,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:24:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 06:24:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 06:24:51,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:51,894 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:51,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:51,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1708784069, now seen corresponding path program 1 times [2024-10-24 06:24:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:51,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696645834] [2024-10-24 06:24:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:51,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:51,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:51,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:24:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:52,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:24:52,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-10-24 06:24:52,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:52,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:52,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696645834] [2024-10-24 06:24:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696645834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:52,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:24:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845296011] [2024-10-24 06:24:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:52,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:24:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:52,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:24:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:24:52,371 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 06:24:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:52,560 INFO L93 Difference]: Finished difference Result 131 states and 233 transitions. [2024-10-24 06:24:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:24:52,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-10-24 06:24:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:52,584 INFO L225 Difference]: With dead ends: 131 [2024-10-24 06:24:52,584 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 06:24:52,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:24:52,592 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:52,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:24:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 06:24:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-24 06:24:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 06:24:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 100 transitions. [2024-10-24 06:24:52,642 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 100 transitions. Word has length 147 [2024-10-24 06:24:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:52,642 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 100 transitions. [2024-10-24 06:24:52,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 06:24:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2024-10-24 06:24:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 06:24:52,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:52,646 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:52,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:24:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:52,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:52,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash -887805817, now seen corresponding path program 1 times [2024-10-24 06:24:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:52,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074599574] [2024-10-24 06:24:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:52,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:52,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:52,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:52,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:24:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:53,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:24:53,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 06:24:53,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:53,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:53,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074599574] [2024-10-24 06:24:53,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074599574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:53,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:53,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:24:53,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280275972] [2024-10-24 06:24:53,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:53,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:24:53,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:24:53,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:53,212 INFO L87 Difference]: Start difference. First operand 65 states and 100 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 06:24:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:53,785 INFO L93 Difference]: Finished difference Result 129 states and 199 transitions. [2024-10-24 06:24:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:24:53,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-10-24 06:24:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:53,824 INFO L225 Difference]: With dead ends: 129 [2024-10-24 06:24:53,824 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 06:24:53,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:24:53,826 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:53,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 06:24:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 06:24:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-24 06:24:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 06:24:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2024-10-24 06:24:53,839 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 148 [2024-10-24 06:24:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:53,841 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2024-10-24 06:24:53,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 06:24:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2024-10-24 06:24:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 06:24:53,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:53,843 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:53,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 06:24:54,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:54,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:54,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash 887201545, now seen corresponding path program 1 times [2024-10-24 06:24:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:54,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076333885] [2024-10-24 06:24:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:54,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:54,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:54,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:54,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:24:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:54,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:24:54,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:24:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 06:24:54,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:24:54,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:24:54,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076333885] [2024-10-24 06:24:54,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076333885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:24:54,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:24:54,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:24:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844220304] [2024-10-24 06:24:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:24:54,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:24:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:24:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:24:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:24:54,526 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 06:24:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:24:56,246 INFO L93 Difference]: Finished difference Result 272 states and 407 transitions. [2024-10-24 06:24:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 06:24:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-10-24 06:24:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:24:56,251 INFO L225 Difference]: With dead ends: 272 [2024-10-24 06:24:56,251 INFO L226 Difference]: Without dead ends: 208 [2024-10-24 06:24:56,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:24:56,254 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 237 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:24:56,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 395 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 06:24:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-24 06:24:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 122. [2024-10-24 06:24:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 06:24:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-10-24 06:24:56,287 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 148 [2024-10-24 06:24:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:24:56,288 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-10-24 06:24:56,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 06:24:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-10-24 06:24:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 06:24:56,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:24:56,291 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:24:56,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 06:24:56,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:56,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:24:56,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:24:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 887261127, now seen corresponding path program 1 times [2024-10-24 06:24:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:24:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596328226] [2024-10-24 06:24:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:24:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:24:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:24:56,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:24:56,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:24:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:24:56,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 06:24:56,809 INFO L278 TraceCheckSpWp]: Computing forward predicates...