./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f4a7b1082e4333573d8474d420161db05f750e6258474388ff1e21304d367b67 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:00:47,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:00:47,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:00:47,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:00:47,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:00:47,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:00:47,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:00:47,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:00:47,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:00:47,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:00:47,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:00:47,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:00:47,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:00:47,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:00:47,334 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:00:47,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:00:47,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:00:47,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:00:47,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:00:47,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:00:47,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:00:47,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:00:47,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:00:47,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:00:47,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:00:47,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:00:47,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:00:47,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:00:47,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:00:47,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:00:47,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:00:47,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:00:47,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:00:47,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:00:47,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:00:47,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:00:47,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:00:47,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:00:47,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:00:47,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:00:47,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:00:47,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:00:47,345 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-clean/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-clean/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 -> f4a7b1082e4333573d8474d420161db05f750e6258474388ff1e21304d367b67 [2024-10-11 09:00:47,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:00:47,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:00:47,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:00:47,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:00:47,657 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:00:47,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-10-11 09:00:49,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:00:49,427 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:00:49,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-10-11 09:00:49,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/41fc04606/2df78c2c3a644d33992a6c744deebcfd/FLAG798233b11 [2024-10-11 09:00:49,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/41fc04606/2df78c2c3a644d33992a6c744deebcfd [2024-10-11 09:00:49,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:00:49,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:00:49,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:00:49,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:00:49,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:00:49,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:00:49" (1/1) ... [2024-10-11 09:00:49,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58842360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:49, skipping insertion in model container [2024-10-11 09:00:49,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:00:49" (1/1) ... [2024-10-11 09:00:49,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:00:50,018 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i[919,932] [2024-10-11 09:00:50,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:00:50,113 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:00:50,129 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i[919,932] [2024-10-11 09:00:50,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:00:50,199 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:00:50,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50 WrapperNode [2024-10-11 09:00:50,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:00:50,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:00:50,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:00:50,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:00:50,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,293 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2024-10-11 09:00:50,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:00:50,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:00:50,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:00:50,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:00:50,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,359 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-11 09:00:50,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:00:50,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:00:50,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:00:50,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:00:50,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (1/1) ... [2024-10-11 09:00:50,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:00:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:00:50,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:00:50,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:00:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:00:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:00:50,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:00:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:00:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:00:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:00:50,618 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:00:50,620 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:00:51,281 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 09:00:51,281 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:00:51,337 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:00:51,337 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:00:51,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:00:51 BoogieIcfgContainer [2024-10-11 09:00:51,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:00:51,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:00:51,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:00:51,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:00:51,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:00:49" (1/3) ... [2024-10-11 09:00:51,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db7c39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:00:51, skipping insertion in model container [2024-10-11 09:00:51,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:00:50" (2/3) ... [2024-10-11 09:00:51,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db7c39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:00:51, skipping insertion in model container [2024-10-11 09:00:51,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:00:51" (3/3) ... [2024-10-11 09:00:51,344 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-10-11 09:00:51,358 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:00:51,358 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:00:51,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:00:51,429 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;@7ac2c0d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:00:51,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:00:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 72 states have (on average 1.5972222222222223) internal successors, (115), 73 states have internal predecessors, (115), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:00:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 09:00:51,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:00:51,464 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:00:51,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:00:51,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:00:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2077821084, now seen corresponding path program 1 times [2024-10-11 09:00:51,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:00:51,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812434918] [2024-10-11 09:00:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:00:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:00:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:00:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:00:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:00:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:00:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:00:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:00:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:00:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:00:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:00:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:00:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:00:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:00:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:00:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:00:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:00:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:00:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:00:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:00:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:00:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:00:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:00:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 09:00:52,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:00:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812434918] [2024-10-11 09:00:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812434918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:00:52,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:00:52,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:00:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299558767] [2024-10-11 09:00:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:00:52,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:00:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:00:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:00:52,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:00:52,054 INFO L87 Difference]: Start difference. First operand has 96 states, 72 states have (on average 1.5972222222222223) internal successors, (115), 73 states have internal predecessors, (115), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 09:00:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:00:52,116 INFO L93 Difference]: Finished difference Result 189 states and 333 transitions. [2024-10-11 09:00:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:00:52,122 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2024-10-11 09:00:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:00:52,134 INFO L225 Difference]: With dead ends: 189 [2024-10-11 09:00:52,135 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 09:00:52,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-11 09:00:52,147 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:00:52,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:00:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 09:00:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 09:00:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 71 states have internal predecessors, (110), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:00:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 152 transitions. [2024-10-11 09:00:52,199 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 152 transitions. Word has length 141 [2024-10-11 09:00:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:00:52,200 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 152 transitions. [2024-10-11 09:00:52,200 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 09:00:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 152 transitions. [2024-10-11 09:00:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 09:00:52,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:00:52,204 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:00:52,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:00:52,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:00:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:00:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1861494238, now seen corresponding path program 1 times [2024-10-11 09:00:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:00:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046324072] [2024-10-11 09:00:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:00:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:00:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:00:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:00:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:00:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:00:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:00:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:00:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:00:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:00:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:00:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:00:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:00:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:00:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:00:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:00:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:00:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:00:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:00:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:00:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:00:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:00:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:00:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 09:00:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:00:52,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046324072] [2024-10-11 09:00:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046324072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:00:52,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:00:52,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:00:52,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537690164] [2024-10-11 09:00:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:00:52,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:00:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:00:52,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:00:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:00:52,601 INFO L87 Difference]: Start difference. First operand 94 states and 152 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 09:00:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:00:52,696 INFO L93 Difference]: Finished difference Result 241 states and 392 transitions. [2024-10-11 09:00:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:00:52,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-10-11 09:00:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:00:52,705 INFO L225 Difference]: With dead ends: 241 [2024-10-11 09:00:52,708 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 09:00:52,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-11 09:00:52,712 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:00:52,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 280 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:00:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 09:00:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2024-10-11 09:00:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.5943396226415094) internal successors, (169), 106 states have internal predecessors, (169), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:00:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 211 transitions. [2024-10-11 09:00:52,740 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 211 transitions. Word has length 141 [2024-10-11 09:00:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:00:52,742 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 211 transitions. [2024-10-11 09:00:52,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 09:00:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 211 transitions. [2024-10-11 09:00:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 09:00:52,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:00:52,745 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:00:52,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:00:52,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:00:52,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:00:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1109405914, now seen corresponding path program 1 times [2024-10-11 09:00:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:00:52,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584160797] [2024-10-11 09:00:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:00:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:00:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:00:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:00:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:00:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:00:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:00:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:00:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:00:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:00:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:00:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:00:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:00:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:00:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:00:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:00:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:00:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:00:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:00:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:00:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:00:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:00:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:00:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 09:00:53,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:00:53,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584160797] [2024-10-11 09:00:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584160797] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:00:53,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943495057] [2024-10-11 09:00:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:00:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:00:53,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:00:53,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:00:53,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:00:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:53,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:00:53,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:00:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-10-11 09:00:53,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:00:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 09:00:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943495057] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:00:54,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:00:54,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-11 09:00:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989104788] [2024-10-11 09:00:54,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:00:54,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 09:00:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:00:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 09:00:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:00:54,136 INFO L87 Difference]: Start difference. First operand 129 states and 211 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-10-11 09:00:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:00:54,509 INFO L93 Difference]: Finished difference Result 265 states and 430 transitions. [2024-10-11 09:00:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:00:54,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 141 [2024-10-11 09:00:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:00:54,514 INFO L225 Difference]: With dead ends: 265 [2024-10-11 09:00:54,518 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 09:00:54,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:00:54,520 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 92 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:00:54,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 449 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:00:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 09:00:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-10-11 09:00:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.5675675675675675) internal successors, (174), 111 states have internal predecessors, (174), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:00:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 216 transitions. [2024-10-11 09:00:54,544 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 216 transitions. Word has length 141 [2024-10-11 09:00:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:00:54,545 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 216 transitions. [2024-10-11 09:00:54,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-10-11 09:00:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 216 transitions. [2024-10-11 09:00:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 09:00:54,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:00:54,548 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:00:54,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:00:54,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:00:54,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:00:54,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:00:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 716378904, now seen corresponding path program 1 times [2024-10-11 09:00:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:00:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135626582] [2024-10-11 09:00:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:00:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:00:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:00:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:00:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:00:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:00:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:00:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:00:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:00:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:00:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:00:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:00:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:00:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:00:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:00:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:00:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:00:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:00:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:00:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:00:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:00:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:00:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:00:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 99 proven. 105 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2024-10-11 09:00:55,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:00:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135626582] [2024-10-11 09:00:55,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135626582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:00:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673532928] [2024-10-11 09:00:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:00:55,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:00:55,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:00:55,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:00:55,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:00:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:00:56,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 09:00:56,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:00:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 555 proven. 132 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-11 09:00:57,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:01:01,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673532928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:01:01,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:01:01,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 22 [2024-10-11 09:01:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608209329] [2024-10-11 09:01:01,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:01:01,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 09:01:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:01:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 09:01:01,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-10-11 09:01:01,831 INFO L87 Difference]: Start difference. First operand 135 states and 216 transitions. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2024-10-11 09:01:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:01:02,862 INFO L93 Difference]: Finished difference Result 293 states and 451 transitions. [2024-10-11 09:01:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 09:01:02,863 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) Word has length 141 [2024-10-11 09:01:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:01:02,865 INFO L225 Difference]: With dead ends: 293 [2024-10-11 09:01:02,865 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 09:01:02,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=691, Invalid=1961, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 09:01:02,870 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 309 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:01:02,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 221 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:01:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 09:01:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2024-10-11 09:01:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 123 states have internal predecessors, (183), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:01:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2024-10-11 09:01:02,898 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 141 [2024-10-11 09:01:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:01:02,899 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2024-10-11 09:01:02,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2024-10-11 09:01:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2024-10-11 09:01:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 09:01:02,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:01:02,906 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:01:02,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:01:03,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:01:03,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:01:03,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:01:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash 832673261, now seen corresponding path program 1 times [2024-10-11 09:01:03,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:01:03,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474402167] [2024-10-11 09:01:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:01:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:01:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:01:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [641991590] [2024-10-11 09:01:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:01:03,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:01:03,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:01:03,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:01:03,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:01:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:01:03,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:01:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:01:04,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:01:04,118 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:01:04,119 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:01:04,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:01:04,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:01:04,325 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 09:01:04,451 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:01:04,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:01:04 BoogieIcfgContainer [2024-10-11 09:01:04,456 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:01:04,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:01:04,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:01:04,457 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:01:04,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:00:51" (3/4) ... [2024-10-11 09:01:04,461 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:01:04,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:01:04,463 INFO L158 Benchmark]: Toolchain (without parser) took 14683.02ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 105.9MB in the beginning and 151.1MB in the end (delta: -45.1MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-10-11 09:01:04,463 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:01:04,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.49ms. Allocated memory is still 159.4MB. Free memory was 105.9MB in the beginning and 89.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 09:01:04,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.58ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 81.7MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:01:04,467 INFO L158 Benchmark]: Boogie Preprocessor took 131.38ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 73.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 09:01:04,467 INFO L158 Benchmark]: RCFGBuilder took 910.38ms. Allocated memory is still 159.4MB. Free memory was 73.3MB in the beginning and 113.5MB in the end (delta: -40.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-10-11 09:01:04,467 INFO L158 Benchmark]: TraceAbstraction took 13117.07ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 112.8MB in the beginning and 152.1MB in the end (delta: -39.4MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-10-11 09:01:04,468 INFO L158 Benchmark]: Witness Printer took 5.80ms. Allocated memory is still 262.1MB. Free memory was 152.1MB in the beginning and 151.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:01:04,469 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.25ms. Allocated memory is still 159.4MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.49ms. Allocated memory is still 159.4MB. Free memory was 105.9MB in the beginning and 89.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.58ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 81.7MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.38ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 73.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 910.38ms. Allocated memory is still 159.4MB. Free memory was 73.3MB in the beginning and 113.5MB in the end (delta: -40.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13117.07ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 112.8MB in the beginning and 152.1MB in the end (delta: -39.4MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 5.80ms. Allocated memory is still 262.1MB. Free memory was 152.1MB in the beginning and 151.1MB in the end (delta: 1.0MB). 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 156, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1230640054; [L25] signed long int var_1_6 = 1508873667; [L26] unsigned char var_1_7 = 64; [L27] unsigned char var_1_8 = 200; [L28] unsigned char var_1_9 = 16; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 8; [L31] float var_1_12 = 15.4; [L32] float var_1_16 = 10000000000000.375; [L33] float var_1_17 = 16.4; [L34] float var_1_18 = 8.5; [L35] float var_1_19 = 64.75; [L36] unsigned char var_1_20 = 16; [L37] signed char var_1_22 = 0; [L38] unsigned char var_1_23 = 16; [L39] unsigned char var_1_24 = 128; [L40] signed short int var_1_30 = -256; [L41] signed short int var_1_31 = 2; [L42] signed short int var_1_34 = -2; [L43] signed short int var_1_36 = -50; [L44] unsigned char var_1_37 = 4; [L45] unsigned char var_1_38 = 64; [L46] float var_1_40 = 0.8; [L47] signed short int var_1_44 = 1; [L48] signed long int var_1_45 = 4; [L49] float var_1_46 = 1000000000000.375; [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] FCALL updateLastVariables() [L164] CALL updateVariables() [L120] var_1_2 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L121] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L123] var_1_3 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L124] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L126] var_1_6 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_6 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=200, var_1_9=16] [L127] RET assume_abort_if_not(var_1_6 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=200, var_1_9=16] [L128] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=200, var_1_9=16] [L128] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=200, var_1_9=16] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=16] [L130] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=16] [L131] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=16] [L131] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=16] [L132] var_1_9 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66] [L133] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66] [L134] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L134] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L135] var_1_10 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L137] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L138] var_1_11 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L139] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L140] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L141] var_1_17 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L142] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L143] var_1_18 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L144] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L146] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L147] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_20 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L148] RET assume_abort_if_not(var_1_20 != 127) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L149] var_1_38 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_38 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L150] RET assume_abort_if_not(var_1_38 >= 63) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L151] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=64, var_1_8=-66, var_1_9=0] [L164] RET updateVariables() [L165] CALL step() [L53] var_1_7 = ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11))) [L54] var_1_16 = (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L55] COND FALSE !((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) [L62] var_1_23 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=31, var_1_22=0, var_1_23=31, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L64] COND FALSE !(\read(var_1_2)) [L67] var_1_1 = (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=0, var_1_23=31, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L69] signed long int stepLocal_1 = var_1_9 % (var_1_8 - var_1_20); VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=0, var_1_23=31, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L70] EXPR var_1_7 ^ var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=0, var_1_23=31, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L70] signed long int stepLocal_0 = var_1_7 ^ var_1_10; [L71] COND FALSE !(stepLocal_1 > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=0, var_1_23=31, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L76] COND TRUE (var_1_11 % var_1_20) < var_1_1 [L77] var_1_22 = ((((10) > (var_1_10)) ? (10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L79] COND TRUE ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f)) [L80] var_1_12 = 31.5f VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L82] COND TRUE (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) >= (var_1_23 % var_1_3)) || var_1_2 [L83] var_1_24 = ((((var_1_8 - 8) < 0 ) ? -(var_1_8 - 8) : (var_1_8 - 8))) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L87] var_1_30 = var_1_8 VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L88] COND FALSE !(((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) < var_1_18) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L93] COND FALSE !(1 >= var_1_20) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L98] EXPR var_1_7 & var_1_10 VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L98] COND FALSE !(var_1_8 <= (var_1_7 & var_1_10)) [L101] COND TRUE var_1_3 >= ((((32) > (var_1_8)) ? (32) : (var_1_8))) [L102] var_1_37 = (var_1_8 - (var_1_38 - var_1_11)) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=158, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L106] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=158, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L109] COND FALSE !(var_1_17 != var_1_16) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=158, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L114] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=121, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=158, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L117] var_1_46 = var_1_17 [L165] RET step() [L166] CALL, EXPR property() [L156] EXPR ((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=158, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=2, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L156-L157] return ((((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1)) && (((var_1_11 % var_1_20) < var_1_1) ? (var_1_22 == ((signed char) ((((10) > (var_1_10)) ? (10) : (var_1_10))))) : 1)) && (((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) ? ((var_1_10 > var_1_7) ? (var_1_23 == ((unsigned char) ((((var_1_20) < ((var_1_8 - var_1_9))) ? (var_1_20) : ((var_1_8 - var_1_9)))))) : (var_1_23 == ((unsigned char) (((((var_1_20) > (64)) ? (var_1_20) : (64))) + var_1_11)))) : (var_1_23 == ((unsigned char) var_1_20))) ; [L166] RET, EXPR property() [L166] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=158, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=2, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741795, var_1_20=31, var_1_22=10, var_1_23=31, var_1_24=182, var_1_2=0, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=158, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=2, var_1_6=1073742037, var_1_7=121, var_1_8=-66, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 473 mSDsluCounter, 1098 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 623 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 696 IncrementalHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 475 mSDtfsCounter, 696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 683 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=4, InterpolantAutomatonStates: 38, 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, 4 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1130 NumberOfCodeBlocks, 1130 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 980 ConstructedInterpolants, 0 QuantifiedInterpolants, 4769 SizeOfPredicates, 5 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 5517/5880 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-11 09:01:04,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f4a7b1082e4333573d8474d420161db05f750e6258474388ff1e21304d367b67 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:01:06,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:01:07,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:01:07,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:01:07,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:01:07,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:01:07,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:01:07,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:01:07,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:01:07,111 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:01:07,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:01:07,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:01:07,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:01:07,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:01:07,113 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:01:07,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:01:07,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:01:07,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:01:07,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:01:07,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:01:07,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:01:07,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:01:07,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:01:07,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:01:07,123 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:01:07,124 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:01:07,124 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:01:07,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:01:07,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:01:07,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:01:07,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:01:07,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:01:07,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:01:07,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:01:07,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:01:07,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:01:07,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:01:07,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:01:07,130 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:01:07,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:01:07,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:01:07,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:01:07,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:01:07,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:01:07,133 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:01:07,133 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-clean/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-clean/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 -> f4a7b1082e4333573d8474d420161db05f750e6258474388ff1e21304d367b67 [2024-10-11 09:01:07,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:01:07,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:01:07,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:01:07,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:01:07,593 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:01:07,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-10-11 09:01:09,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:01:09,499 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:01:09,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-10-11 09:01:09,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c91437096/395d283812744e64b3132e97e6396758/FLAG78c8db4e7 [2024-10-11 09:01:09,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c91437096/395d283812744e64b3132e97e6396758 [2024-10-11 09:01:09,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:01:09,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:01:09,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:01:09,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:01:09,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:01:09,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:01:09" (1/1) ... [2024-10-11 09:01:09,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d610139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:09, skipping insertion in model container [2024-10-11 09:01:09,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:01:09" (1/1) ... [2024-10-11 09:01:09,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:01:09,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i[919,932] [2024-10-11 09:01:09,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:01:09,943 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:01:09,956 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i[919,932] [2024-10-11 09:01:10,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:01:10,032 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:01:10,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10 WrapperNode [2024-10-11 09:01:10,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:01:10,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:01:10,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:01:10,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:01:10,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,099 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-10-11 09:01:10,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:01:10,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:01:10,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:01:10,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:01:10,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,142 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-11 09:01:10,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:01:10,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:01:10,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:01:10,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:01:10,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (1/1) ... [2024-10-11 09:01:10,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:01:10,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:01:10,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:01:10,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:01:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:01:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:01:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:01:10,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:01:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:01:10,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:01:10,353 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:01:10,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:01:12,866 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 09:01:12,866 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:01:12,937 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:01:12,938 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:01:12,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:01:12 BoogieIcfgContainer [2024-10-11 09:01:12,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:01:12,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:01:12,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:01:12,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:01:12,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:01:09" (1/3) ... [2024-10-11 09:01:12,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6cb727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:01:12, skipping insertion in model container [2024-10-11 09:01:12,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:01:10" (2/3) ... [2024-10-11 09:01:12,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6cb727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:01:12, skipping insertion in model container [2024-10-11 09:01:12,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:01:12" (3/3) ... [2024-10-11 09:01:12,951 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-10-11 09:01:12,970 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:01:12,970 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:01:13,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:01:13,064 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;@2049fd69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:01:13,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:01:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 42 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:01:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:01:13,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:01:13,085 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:01:13,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:01:13,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:01:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 305511143, now seen corresponding path program 1 times [2024-10-11 09:01:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:01:13,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812365183] [2024-10-11 09:01:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:01:13,111 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-11 09:01:13,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:01:13,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 09:01:13,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:01:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:01:13,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:01:13,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:01:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-10-11 09:01:13,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:01:13,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:01:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812365183] [2024-10-11 09:01:13,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812365183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:01:13,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:01:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:01:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295929713] [2024-10-11 09:01:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:01:13,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:01:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:01:13,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:01:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:01:13,768 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 42 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 09:01:15,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:01:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:01:15,219 INFO L93 Difference]: Finished difference Result 127 states and 231 transitions. [2024-10-11 09:01:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:01:15,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2024-10-11 09:01:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:01:15,255 INFO L225 Difference]: With dead ends: 127 [2024-10-11 09:01:15,256 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 09:01:15,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-11 09:01:15,262 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:01:15,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 09:01:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 09:01:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 09:01:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.475) internal successors, (59), 40 states have internal predecessors, (59), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:01:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 101 transitions. [2024-10-11 09:01:15,313 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 101 transitions. Word has length 136 [2024-10-11 09:01:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:01:15,315 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 101 transitions. [2024-10-11 09:01:15,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 09:01:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 101 transitions. [2024-10-11 09:01:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:01:15,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:01:15,320 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:01:15,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:01:15,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 09:01:15,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:01:15,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:01:15,522 INFO L85 PathProgramCache]: Analyzing trace with hash 892332077, now seen corresponding path program 1 times [2024-10-11 09:01:15,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:01:15,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443427879] [2024-10-11 09:01:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:01:15,523 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-11 09:01:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:01:15,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 09:01:15,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:01:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:01:16,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:01:16,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:01:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-11 09:01:18,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:01:18,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:01:18,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443427879] [2024-10-11 09:01:18,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443427879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:01:18,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1605395585] [2024-10-11 09:01:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:01:18,343 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:01:18,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:01:18,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:01:18,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 09:01:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:01:18,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:01:18,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:01:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 09:01:18,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:01:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1605395585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:01:18,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:01:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 09:01:18,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111125831] [2024-10-11 09:01:18,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:01:18,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:01:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:01:18,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:01:18,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:01:18,967 INFO L87 Difference]: Start difference. First operand 63 states and 101 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 09:01:20,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:01:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:01:20,311 INFO L93 Difference]: Finished difference Result 148 states and 239 transitions. [2024-10-11 09:01:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:01:20,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-10-11 09:01:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:01:20,341 INFO L225 Difference]: With dead ends: 148 [2024-10-11 09:01:20,342 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 09:01:20,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:01:20,344 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:01:20,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 179 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 09:01:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 09:01:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-10-11 09:01:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.543859649122807) internal successors, (88), 57 states have internal predecessors, (88), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:01:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 130 transitions. [2024-10-11 09:01:20,357 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 130 transitions. Word has length 136 [2024-10-11 09:01:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:01:20,359 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 130 transitions. [2024-10-11 09:01:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 09:01:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 130 transitions. [2024-10-11 09:01:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:01:20,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:01:20,365 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:01:20,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:01:20,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:01:20,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 09:01:20,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:01:20,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:01:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash 949649961, now seen corresponding path program 1 times [2024-10-11 09:01:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:01:20,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957644906] [2024-10-11 09:01:20,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:01:20,769 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-11 09:01:20,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:01:20,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 09:01:20,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:01:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:01:21,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:01:21,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:01:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-11 09:01:23,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:01:23,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:01:23,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957644906] [2024-10-11 09:01:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957644906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:01:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2134471524] [2024-10-11 09:01:23,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:01:23,394 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:01:23,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:01:23,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:01:23,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 09:01:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:01:25,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:01:25,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:01:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-11 09:01:26,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:01:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2134471524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:01:26,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:01:26,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 09:01:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113332964] [2024-10-11 09:01:26,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:01:26,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:01:26,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:01:26,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:01:26,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:01:26,850 INFO L87 Difference]: Start difference. First operand 80 states and 130 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 09:01:29,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:01:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:01:29,901 INFO L93 Difference]: Finished difference Result 171 states and 269 transitions. [2024-10-11 09:01:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:01:29,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 136 [2024-10-11 09:01:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:01:29,931 INFO L225 Difference]: With dead ends: 171 [2024-10-11 09:01:29,931 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 09:01:29,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 09:01:29,933 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:01:29,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 210 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 09:01:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 09:01:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-10-11 09:01:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 63 states have internal predecessors, (92), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:01:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2024-10-11 09:01:29,955 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 136 [2024-10-11 09:01:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:01:29,955 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2024-10-11 09:01:29,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 09:01:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2024-10-11 09:01:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:01:29,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:01:29,961 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 09:01:29,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-11 09:01:30,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 09:01:30,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-clean/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-11 09:01:30,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:01:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:01:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash 140303335, now seen corresponding path program 1 times [2024-10-11 09:01:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:01:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880135923] [2024-10-11 09:01:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:01:30,364 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-11 09:01:30,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:01:30,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 09:01:30,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 09:01:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:01:30,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 09:01:30,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:02:07,134 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)