./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_codestructure_dependencies_file-85.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_codestructure_dependencies_file-85.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 c7670603e0a087e73dc969b282734c8dd43456b4629350be39c8fff98720cbe1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:14:09,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:14:09,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:14:09,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:14:09,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:14:09,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:14:09,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:14:09,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:14:09,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:14:09,190 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:14:09,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:14:09,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:14:09,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:14:09,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:14:09,193 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:14:09,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:14:09,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:14:09,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:14:09,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:14:09,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:14:09,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:14:09,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:14:09,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:14:09,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:14:09,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:14:09,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:14:09,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:14:09,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:14:09,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:14:09,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:14:09,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:14:09,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:14:09,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:14:09,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:14:09,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:14:09,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:14:09,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:14:09,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:14:09,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:14:09,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:14:09,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:14:09,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:14:09,199 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 -> c7670603e0a087e73dc969b282734c8dd43456b4629350be39c8fff98720cbe1 [2024-10-11 07:14:09,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:14:09,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:14:09,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:14:09,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:14:09,423 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:14:09,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-85.i [2024-10-11 07:14:10,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:14:10,779 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:14:10,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-85.i [2024-10-11 07:14:10,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b59f75c93/18be7f27a34f40c08849ea2b3e6b68e2/FLAGd4c5a7726 [2024-10-11 07:14:11,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b59f75c93/18be7f27a34f40c08849ea2b3e6b68e2 [2024-10-11 07:14:11,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:14:11,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:14:11,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:14:11,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:14:11,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:14:11,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9ed964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11, skipping insertion in model container [2024-10-11 07:14:11,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:14:11,354 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_codestructure_dependencies_file-85.i[919,932] [2024-10-11 07:14:11,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:14:11,439 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:14:11,448 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_codestructure_dependencies_file-85.i[919,932] [2024-10-11 07:14:11,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:14:11,493 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:14:11,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11 WrapperNode [2024-10-11 07:14:11,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:14:11,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:14:11,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:14:11,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:14:11,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,531 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-11 07:14:11,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:14:11,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:14:11,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:14:11,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:14:11,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,558 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 07:14:11,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:14:11,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:14:11,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:14:11,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:14:11,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (1/1) ... [2024-10-11 07:14:11,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:14:11,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:14:11,606 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 07:14:11,609 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 07:14:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:14:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:14:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:14:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:14:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:14:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:14:11,709 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:14:11,710 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:14:11,926 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:14:11,926 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:14:11,957 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:14:11,957 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:14:11,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:11 BoogieIcfgContainer [2024-10-11 07:14:11,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:14:11,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:14:11,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:14:11,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:14:11,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:14:11" (1/3) ... [2024-10-11 07:14:11,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3c5d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:14:11, skipping insertion in model container [2024-10-11 07:14:11,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:11" (2/3) ... [2024-10-11 07:14:11,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3c5d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:14:11, skipping insertion in model container [2024-10-11 07:14:11,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:11" (3/3) ... [2024-10-11 07:14:11,968 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-85.i [2024-10-11 07:14:11,981 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:14:11,982 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:14:12,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:14:12,034 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;@488ac4ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:14:12,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:14:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.5) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:14:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 07:14:12,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:12,047 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:12,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:12,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:12,053 INFO L85 PathProgramCache]: Analyzing trace with hash -162473035, now seen corresponding path program 1 times [2024-10-11 07:14:12,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847673071] [2024-10-11 07:14:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:14:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:14:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 07:14:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:14:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:14:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:14:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847673071] [2024-10-11 07:14:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847673071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:12,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:14:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500393758] [2024-10-11 07:14:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:12,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:14:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:14:12,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:14:12,363 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.5) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:14:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:12,400 INFO L93 Difference]: Finished difference Result 89 states and 157 transitions. [2024-10-11 07:14:12,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:14:12,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 95 [2024-10-11 07:14:12,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:12,422 INFO L225 Difference]: With dead ends: 89 [2024-10-11 07:14:12,423 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 07:14:12,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 07:14:12,433 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:12,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:14:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 07:14:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 07:14:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:14:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2024-10-11 07:14:12,493 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 95 [2024-10-11 07:14:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:12,494 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2024-10-11 07:14:12,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:14:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2024-10-11 07:14:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 07:14:12,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:12,502 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:12,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:14:12,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:12,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1602469675, now seen corresponding path program 1 times [2024-10-11 07:14:12,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511929695] [2024-10-11 07:14:12,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:12,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:14:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:14:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 07:14:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:14:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:14:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:14:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:13,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511929695] [2024-10-11 07:14:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511929695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:13,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:14:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027812541] [2024-10-11 07:14:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:13,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:14:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:13,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:14:13,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:14:13,103 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:13,296 INFO L93 Difference]: Finished difference Result 131 states and 197 transitions. [2024-10-11 07:14:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:14:13,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-11 07:14:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:13,303 INFO L225 Difference]: With dead ends: 131 [2024-10-11 07:14:13,304 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 07:14:13,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:14:13,306 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 45 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:13,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 171 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:14:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 07:14:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2024-10-11 07:14:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:14:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-10-11 07:14:13,337 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 95 [2024-10-11 07:14:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:13,338 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-10-11 07:14:13,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-10-11 07:14:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:14:13,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:13,340 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:13,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:14:13,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:13,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash -716762689, now seen corresponding path program 1 times [2024-10-11 07:14:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:13,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645508807] [2024-10-11 07:14:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:14:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:14:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 07:14:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:14:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:14:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:14:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:13,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645508807] [2024-10-11 07:14:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645508807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:13,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:13,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:14:13,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606698364] [2024-10-11 07:14:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:13,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:14:13,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:13,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:14:13,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:14:13,936 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:14,171 INFO L93 Difference]: Finished difference Result 143 states and 213 transitions. [2024-10-11 07:14:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:14:14,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-11 07:14:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:14,174 INFO L225 Difference]: With dead ends: 143 [2024-10-11 07:14:14,174 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 07:14:14,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:14:14,177 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 73 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:14,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 198 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:14:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 07:14:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2024-10-11 07:14:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:14:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2024-10-11 07:14:14,204 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 96 [2024-10-11 07:14:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:14,206 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2024-10-11 07:14:14,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2024-10-11 07:14:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:14:14,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:14,207 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:14,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:14:14,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:14,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -659504387, now seen corresponding path program 1 times [2024-10-11 07:14:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227099811] [2024-10-11 07:14:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:14:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:14:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 07:14:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:14:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:14:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:14:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 07:14:14,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:14,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227099811] [2024-10-11 07:14:14,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227099811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:14:14,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628338475] [2024-10-11 07:14:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:14,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:14:14,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:14:14,430 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 07:14:14,431 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 07:14:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:14,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 07:14:14,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:14:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-11 07:14:14,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:14:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 07:14:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628338475] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:14:14,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:14:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-11 07:14:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009103307] [2024-10-11 07:14:14,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:14:14,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:14:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:14,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:14:14,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:14:14,773 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 07:14:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:15,064 INFO L93 Difference]: Finished difference Result 190 states and 269 transitions. [2024-10-11 07:14:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 07:14:15,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 96 [2024-10-11 07:14:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:15,067 INFO L225 Difference]: With dead ends: 190 [2024-10-11 07:14:15,067 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 07:14:15,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 07:14:15,068 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 116 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:15,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 192 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:14:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 07:14:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2024-10-11 07:14:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:14:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-10-11 07:14:15,093 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 96 [2024-10-11 07:14:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:15,093 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-10-11 07:14:15,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 07:14:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-10-11 07:14:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:14:15,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:15,094 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:15,108 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 07:14:15,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:14:15,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:15,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1468851013, now seen corresponding path program 1 times [2024-10-11 07:14:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:15,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113166762] [2024-10-11 07:14:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:14:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362066488] [2024-10-11 07:14:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:15,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:14:15,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:14:15,352 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 07:14:15,353 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 07:14:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:14:15,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:14:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:14:15,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:14:15,532 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:14:15,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:14:15,548 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 07:14:15,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:14:15,741 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 07:14:15,802 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:14:15,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:14:15 BoogieIcfgContainer [2024-10-11 07:14:15,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:14:15,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:14:15,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:14:15,805 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:14:15,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:11" (3/4) ... [2024-10-11 07:14:15,807 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:14:15,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:14:15,808 INFO L158 Benchmark]: Toolchain (without parser) took 4616.10ms. Allocated memory was 146.8MB in the beginning and 232.8MB in the end (delta: 86.0MB). Free memory was 74.1MB in the beginning and 78.3MB in the end (delta: -4.2MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2024-10-11 07:14:15,808 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 146.8MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:14:15,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.65ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 74.0MB in the beginning and 162.1MB in the end (delta: -88.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-11 07:14:15,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.85ms. Allocated memory is still 192.9MB. Free memory was 162.1MB in the beginning and 159.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:14:15,809 INFO L158 Benchmark]: Boogie Preprocessor took 39.62ms. Allocated memory is still 192.9MB. Free memory was 159.0MB in the beginning and 154.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:14:15,809 INFO L158 Benchmark]: RCFGBuilder took 381.48ms. Allocated memory is still 192.9MB. Free memory was 154.8MB in the beginning and 130.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 07:14:15,809 INFO L158 Benchmark]: TraceAbstraction took 3841.36ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 130.7MB in the beginning and 78.3MB in the end (delta: 52.3MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2024-10-11 07:14:15,809 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 232.8MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:14:15,811 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.13ms. Allocated memory is still 146.8MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.65ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 74.0MB in the beginning and 162.1MB in the end (delta: -88.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.85ms. Allocated memory is still 192.9MB. Free memory was 162.1MB in the beginning and 159.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.62ms. Allocated memory is still 192.9MB. Free memory was 159.0MB in the beginning and 154.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 381.48ms. Allocated memory is still 192.9MB. Free memory was 154.8MB in the beginning and 130.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3841.36ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 130.7MB in the beginning and 78.3MB in the end (delta: 52.3MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 232.8MB. Free memory is still 78.3MB. 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 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] unsigned long int last_1_var_1_1 = 1000; [L39] unsigned char last_1_var_1_5 = 1; [L40] unsigned long int last_1_var_1_12 = 128; [L41] unsigned char last_1_var_1_13 = 16; [L42] unsigned long int last_1_var_1_15 = 8; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L107] last_1_var_1_1 = var_1_1 [L108] last_1_var_1_5 = var_1_5 [L109] last_1_var_1_12 = var_1_12 [L110] last_1_var_1_13 = var_1_13 [L111] last_1_var_1_15 = var_1_15 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L82] var_1_6 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L83] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L84] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L84] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L85] var_1_8 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L87] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L87] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L88] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L88] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=32] [L89] var_1_9 = __VERIFIER_nondet_ulong() [L90] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L90] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L91] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L91] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33] [L92] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L92] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L93] var_1_11 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L94] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L95] var_1_14 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L96] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L97] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L98] var_1_17 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L99] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L100] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L101] var_1_19 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L102] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L103] var_1_20 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L104] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L122] RET updateVariables() [L123] CALL step() [L46] COND TRUE last_1_var_1_13 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L47] COND TRUE \read(last_1_var_1_5) [L48] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L57] COND TRUE last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1) [L58] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L62] COND FALSE !(var_1_5 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L65] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L66] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L67] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=33, var_1_9=1] [L70] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L75] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L77] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L78] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L123] RET step() [L124] CALL, EXPR property() [L114-L115] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=2, var_1_12=128, var_1_13=0, var_1_14=256, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=33, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 624 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 394 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 230 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 92 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 2462 SizeOfPredicates, 4 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 2502/2520 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 07:14:15,831 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_codestructure_dependencies_file-85.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 c7670603e0a087e73dc969b282734c8dd43456b4629350be39c8fff98720cbe1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:14:17,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:14:17,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:14:17,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:14:17,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:14:17,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:14:17,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:14:17,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:14:17,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:14:17,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:14:17,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:14:17,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:14:17,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:14:17,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:14:17,694 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:14:17,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:14:17,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:14:17,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:14:17,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:14:17,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:14:17,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:14:17,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:14:17,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:14:17,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:14:17,700 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:14:17,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:14:17,700 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:14:17,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:14:17,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:14:17,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:14:17,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:14:17,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:14:17,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:14:17,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:14:17,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:14:17,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:14:17,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:14:17,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:14:17,701 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:14:17,701 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:14:17,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:14:17,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:14:17,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:14:17,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:14:17,704 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:14:17,704 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 -> c7670603e0a087e73dc969b282734c8dd43456b4629350be39c8fff98720cbe1 [2024-10-11 07:14:17,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:14:17,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:14:17,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:14:17,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:14:17,987 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:14:17,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-85.i [2024-10-11 07:14:19,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:14:19,479 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:14:19,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-85.i [2024-10-11 07:14:19,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/320ee477c/7233bbf4c9d04ec59885eb91f62033d1/FLAG38664dece [2024-10-11 07:14:19,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/320ee477c/7233bbf4c9d04ec59885eb91f62033d1 [2024-10-11 07:14:19,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:14:19,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:14:19,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:14:19,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:14:19,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:14:19,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea3fa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19, skipping insertion in model container [2024-10-11 07:14:19,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:14:19,672 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_codestructure_dependencies_file-85.i[919,932] [2024-10-11 07:14:19,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:14:19,747 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:14:19,757 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_codestructure_dependencies_file-85.i[919,932] [2024-10-11 07:14:19,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:14:19,806 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:14:19,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19 WrapperNode [2024-10-11 07:14:19,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:14:19,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:14:19,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:14:19,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:14:19,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,857 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-11 07:14:19,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:14:19,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:14:19,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:14:19,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:14:19,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,888 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 07:14:19,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:14:19,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:14:19,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:14:19,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:14:19,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (1/1) ... [2024-10-11 07:14:19,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:14:19,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:14:19,948 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 07:14:19,950 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 07:14:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:14:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:14:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:14:19,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:14:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:14:19,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:14:20,064 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:14:20,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:14:21,781 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:14:21,781 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:14:21,852 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:14:21,852 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:14:21,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:21 BoogieIcfgContainer [2024-10-11 07:14:21,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:14:21,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:14:21,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:14:21,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:14:21,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:14:19" (1/3) ... [2024-10-11 07:14:21,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553084cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:14:21, skipping insertion in model container [2024-10-11 07:14:21,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:19" (2/3) ... [2024-10-11 07:14:21,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553084cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:14:21, skipping insertion in model container [2024-10-11 07:14:21,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:21" (3/3) ... [2024-10-11 07:14:21,861 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-85.i [2024-10-11 07:14:21,875 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:14:21,875 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:14:21,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:14:21,936 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;@1fc19f4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:14:21,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:14:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.5) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:14:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 07:14:21,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:21,950 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:21,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -162473035, now seen corresponding path program 1 times [2024-10-11 07:14:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:14:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703478531] [2024-10-11 07:14:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:21,967 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 07:14:21,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:14:21,968 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 07:14:21,989 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 07:14:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:22,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:14:22,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:14:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-11 07:14:22,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:14:22,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:14:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703478531] [2024-10-11 07:14:22,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703478531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:22,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:22,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:14:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481913197] [2024-10-11 07:14:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:22,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:14:22,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:14:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:14:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:14:22,372 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.5) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:14:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:23,324 INFO L93 Difference]: Finished difference Result 89 states and 157 transitions. [2024-10-11 07:14:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:14:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 95 [2024-10-11 07:14:23,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:23,353 INFO L225 Difference]: With dead ends: 89 [2024-10-11 07:14:23,353 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 07:14:23,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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 07:14:23,358 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:23,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 07:14:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 07:14:23,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 07:14:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:14:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2024-10-11 07:14:23,397 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 95 [2024-10-11 07:14:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:23,398 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2024-10-11 07:14:23,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:14:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2024-10-11 07:14:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 07:14:23,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:23,404 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:23,417 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 07:14:23,605 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 07:14:23,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1602469675, now seen corresponding path program 1 times [2024-10-11 07:14:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:14:23,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477003032] [2024-10-11 07:14:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:23,607 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 07:14:23,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:14:23,609 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 07:14:23,610 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 07:14:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:23,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 07:14:23,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:14:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:24,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:14:24,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:14:24,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477003032] [2024-10-11 07:14:24,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477003032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:24,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:24,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:14:24,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140663331] [2024-10-11 07:14:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:24,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:14:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:14:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:14:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:14:24,348 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:25,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:14:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:25,795 INFO L93 Difference]: Finished difference Result 87 states and 131 transitions. [2024-10-11 07:14:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:14:25,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-11 07:14:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:25,819 INFO L225 Difference]: With dead ends: 87 [2024-10-11 07:14:25,819 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 07:14:25,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:14:25,820 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:25,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 07:14:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 07:14:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 07:14:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:14:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2024-10-11 07:14:25,828 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 95 [2024-10-11 07:14:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:25,829 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2024-10-11 07:14:25,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2024-10-11 07:14:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:14:25,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:25,834 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:25,852 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 (3)] Ended with exit code 0 [2024-10-11 07:14:26,034 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 [2024-10-11 07:14:26,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:26,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash -716762689, now seen corresponding path program 1 times [2024-10-11 07:14:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:14:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012490416] [2024-10-11 07:14:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:26,037 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 07:14:26,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:14:26,039 INFO L229 MonitoredProcess]: Starting monitored process 4 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 07:14:26,040 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 (4)] Waiting until timeout for monitored process [2024-10-11 07:14:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:26,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 07:14:26,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:14:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-11 07:14:27,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:14:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 07:14:27,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:14:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012490416] [2024-10-11 07:14:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012490416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:14:27,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:14:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-10-11 07:14:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816572839] [2024-10-11 07:14:27,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:14:27,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 07:14:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:14:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 07:14:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:14:27,745 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-11 07:14:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:32,604 INFO L93 Difference]: Finished difference Result 200 states and 292 transitions. [2024-10-11 07:14:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 07:14:32,605 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 96 [2024-10-11 07:14:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:32,607 INFO L225 Difference]: With dead ends: 200 [2024-10-11 07:14:32,607 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 07:14:32,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-11 07:14:32,609 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 291 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:32,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 405 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 07:14:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 07:14:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 112. [2024-10-11 07:14:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 67 states have internal predecessors, (82), 41 states have call successors, (41), 4 states have call predecessors, (41), 4 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 07:14:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2024-10-11 07:14:32,643 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 96 [2024-10-11 07:14:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:32,644 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2024-10-11 07:14:32,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-11 07:14:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2024-10-11 07:14:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:14:32,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:32,646 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:14:32,660 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 07:14:32,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 07:14:32,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1468851013, now seen corresponding path program 1 times [2024-10-11 07:14:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:14:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722751465] [2024-10-11 07:14:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:32,849 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 07:14:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:14:32,851 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 07:14:32,852 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 07:14:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:33,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 07:14:33,107 INFO L278 TraceCheckSpWp]: Computing forward predicates...