./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c9e4d60c6de1cb08a2f723e9da560ca057ed252e0551052818f5b37c6c97569 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:06:23,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:06:23,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:06:23,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:06:23,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:06:23,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:06:23,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:06:23,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:06:23,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:06:23,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:06:23,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:06:23,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:06:23,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:06:23,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:06:23,139 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:06:23,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:06:23,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:06:23,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:06:23,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:06:23,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:06:23,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:06:23,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:06:23,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:06:23,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:06:23,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:06:23,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:06:23,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:06:23,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:06:23,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:06:23,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:06:23,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:06:23,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:06:23,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:06:23,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:06:23,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:06:23,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:06:23,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:06:23,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:06:23,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:06:23,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:06:23,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:06:23,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:06:23,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c9e4d60c6de1cb08a2f723e9da560ca057ed252e0551052818f5b37c6c97569 [2024-11-12 01:06:23,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:06:23,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:06:23,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:06:23,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:06:23,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:06:23,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i [2024-11-12 01:06:24,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:06:24,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:06:24,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i [2024-11-12 01:06:24,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cf5ec72/825ec6f1c8cc48f48aa4a5f7ee601ebb/FLAG835227d94 [2024-11-12 01:06:24,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4cf5ec72/825ec6f1c8cc48f48aa4a5f7ee601ebb [2024-11-12 01:06:24,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:06:24,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:06:24,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:06:24,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:06:24,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:06:24,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:24" (1/1) ... [2024-11-12 01:06:24,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761362e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:24, skipping insertion in model container [2024-11-12 01:06:24,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:24" (1/1) ... [2024-11-12 01:06:24,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:06:24,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i[919,932] [2024-11-12 01:06:25,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:06:25,043 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:06:25,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i[919,932] [2024-11-12 01:06:25,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:06:25,091 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:06:25,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25 WrapperNode [2024-11-12 01:06:25,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:06:25,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:06:25,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:06:25,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:06:25,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,132 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-11-12 01:06:25,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:06:25,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:06:25,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:06:25,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:06:25,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,165 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:06:25,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:06:25,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:06:25,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:06:25,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:06:25,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (1/1) ... [2024-11-12 01:06:25,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:06:25,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:25,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:06:25,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:06:25,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:06:25,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:06:25,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:06:25,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:06:25,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:06:25,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:06:25,312 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:06:25,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:06:25,557 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 01:06:25,558 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:06:25,568 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:06:25,568 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:06:25,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:25 BoogieIcfgContainer [2024-11-12 01:06:25,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:06:25,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:06:25,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:06:25,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:06:25,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:06:24" (1/3) ... [2024-11-12 01:06:25,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f5c3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:06:25, skipping insertion in model container [2024-11-12 01:06:25,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:25" (2/3) ... [2024-11-12 01:06:25,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f5c3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:06:25, skipping insertion in model container [2024-11-12 01:06:25,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:25" (3/3) ... [2024-11-12 01:06:25,577 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-76.i [2024-11-12 01:06:25,589 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:06:25,589 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:06:25,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:06:25,637 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;@452976d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:06:25,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:06:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 01:06:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 01:06:25,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:25,649 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:25,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:25,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 885989570, now seen corresponding path program 1 times [2024-11-12 01:06:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:25,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109493010] [2024-11-12 01:06:25,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:06:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:06:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:06:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:06:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 01:06:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 01:06:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 01:06:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 01:06:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:06:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 01:06:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:06:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:06:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:06:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:06:25,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:06:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109493010] [2024-11-12 01:06:25,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109493010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:25,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:06:25,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:06:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352707135] [2024-11-12 01:06:25,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:25,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:06:25,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:06:25,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:06:25,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:06:25,974 INFO L87 Difference]: Start difference. First operand has 61 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:06:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:25,992 INFO L93 Difference]: Finished difference Result 111 states and 187 transitions. [2024-11-12 01:06:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:06:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-11-12 01:06:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:25,999 INFO L225 Difference]: With dead ends: 111 [2024-11-12 01:06:26,000 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 01:06:26,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:06:26,004 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:26,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:06:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 01:06:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-12 01:06:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 01:06:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions. [2024-11-12 01:06:26,034 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 92 [2024-11-12 01:06:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:26,034 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 78 transitions. [2024-11-12 01:06:26,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:06:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions. [2024-11-12 01:06:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 01:06:26,037 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:26,037 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:26,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:06:26,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:26,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1311777212, now seen corresponding path program 1 times [2024-11-12 01:06:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306402301] [2024-11-12 01:06:26,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:06:26,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900756287] [2024-11-12 01:06:26,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:26,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:26,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:06:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 01:06:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:26,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 01:06:26,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:06:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:06:26,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:06:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:06:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306402301] [2024-11-12 01:06:26,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 01:06:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900756287] [2024-11-12 01:06:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900756287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:26,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:06:26,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:06:26,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003690699] [2024-11-12 01:06:26,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:26,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 01:06:26,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:06:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 01:06:26,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:06:26,814 INFO L87 Difference]: Start difference. First operand 53 states and 78 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:27,276 INFO L93 Difference]: Finished difference Result 398 states and 588 transitions. [2024-11-12 01:06:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 01:06:27,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-12 01:06:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:27,280 INFO L225 Difference]: With dead ends: 398 [2024-11-12 01:06:27,280 INFO L226 Difference]: Without dead ends: 348 [2024-11-12 01:06:27,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 01:06:27,282 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 453 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:27,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 424 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 01:06:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-12 01:06:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 208. [2024-11-12 01:06:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 151 states have (on average 1.4172185430463575) internal successors, (214), 151 states have internal predecessors, (214), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 01:06:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 318 transitions. [2024-11-12 01:06:27,321 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 318 transitions. Word has length 92 [2024-11-12 01:06:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:27,322 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 318 transitions. [2024-11-12 01:06:27,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2024-11-12 01:06:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 01:06:27,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:27,323 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:27,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 01:06:27,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:27,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:27,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash 724971198, now seen corresponding path program 1 times [2024-11-12 01:06:27,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486839499] [2024-11-12 01:06:27,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:27,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:06:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387885488] [2024-11-12 01:06:27,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:27,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:27,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:27,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:06:27,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 01:06:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:27,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 01:06:27,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:06:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:06:27,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:06:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:06:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486839499] [2024-11-12 01:06:27,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 01:06:27,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387885488] [2024-11-12 01:06:27,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387885488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:27,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:06:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:06:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888403533] [2024-11-12 01:06:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:27,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:06:27,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:06:27,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:06:27,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:06:27,802 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:27,951 INFO L93 Difference]: Finished difference Result 752 states and 1143 transitions. [2024-11-12 01:06:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 01:06:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-12 01:06:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:27,958 INFO L225 Difference]: With dead ends: 752 [2024-11-12 01:06:27,958 INFO L226 Difference]: Without dead ends: 547 [2024-11-12 01:06:27,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:06:27,960 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 150 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:27,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 592 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:06:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-12 01:06:28,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 288. [2024-11-12 01:06:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 217 states have (on average 1.4700460829493087) internal successors, (319), 217 states have internal predecessors, (319), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-12 01:06:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 449 transitions. [2024-11-12 01:06:28,020 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 449 transitions. Word has length 92 [2024-11-12 01:06:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:28,021 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 449 transitions. [2024-11-12 01:06:28,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 449 transitions. [2024-11-12 01:06:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 01:06:28,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:28,025 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:28,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 01:06:28,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 01:06:28,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1729875601, now seen corresponding path program 1 times [2024-11-12 01:06:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846233183] [2024-11-12 01:06:28,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:06:28,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586172351] [2024-11-12 01:06:28,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:28,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:28,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:28,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:06:28,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 01:06:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:28,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 01:06:28,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:06:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:06:28,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:06:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:06:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846233183] [2024-11-12 01:06:28,756 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 01:06:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586172351] [2024-11-12 01:06:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586172351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:06:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 01:06:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171144253] [2024-11-12 01:06:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 01:06:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:06:28,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 01:06:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:06:28,758 INFO L87 Difference]: Start difference. First operand 288 states and 449 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:29,139 INFO L93 Difference]: Finished difference Result 461 states and 693 transitions. [2024-11-12 01:06:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 01:06:29,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-12 01:06:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:29,141 INFO L225 Difference]: With dead ends: 461 [2024-11-12 01:06:29,142 INFO L226 Difference]: Without dead ends: 411 [2024-11-12 01:06:29,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 01:06:29,143 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 441 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:29,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 525 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 01:06:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-12 01:06:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 287. [2024-11-12 01:06:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 216 states have (on average 1.4675925925925926) internal successors, (317), 216 states have internal predecessors, (317), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-12 01:06:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 447 transitions. [2024-11-12 01:06:29,165 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 447 transitions. Word has length 93 [2024-11-12 01:06:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:29,166 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 447 transitions. [2024-11-12 01:06:29,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 447 transitions. [2024-11-12 01:06:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 01:06:29,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:29,170 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:29,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 01:06:29,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:29,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:29,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1481985493, now seen corresponding path program 1 times [2024-11-12 01:06:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:29,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750405235] [2024-11-12 01:06:29,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:06:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:06:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:06:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:06:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 01:06:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 01:06:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 01:06:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 01:06:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:06:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 01:06:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:06:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:06:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:06:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:06:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:06:29,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750405235] [2024-11-12 01:06:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750405235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:06:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:06:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148763337] [2024-11-12 01:06:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:29,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:06:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:06:29,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:06:29,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:06:29,463 INFO L87 Difference]: Start difference. First operand 287 states and 447 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:29,510 INFO L93 Difference]: Finished difference Result 706 states and 1102 transitions. [2024-11-12 01:06:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:06:29,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-12 01:06:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:29,514 INFO L225 Difference]: With dead ends: 706 [2024-11-12 01:06:29,514 INFO L226 Difference]: Without dead ends: 422 [2024-11-12 01:06:29,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:06:29,515 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 23 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:29,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:06:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-12 01:06:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 370. [2024-11-12 01:06:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 299 states have (on average 1.491638795986622) internal successors, (446), 299 states have internal predecessors, (446), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-12 01:06:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 576 transitions. [2024-11-12 01:06:29,535 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 576 transitions. Word has length 93 [2024-11-12 01:06:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:29,536 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 576 transitions. [2024-11-12 01:06:29,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 576 transitions. [2024-11-12 01:06:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 01:06:29,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:29,537 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:29,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 01:06:29,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:29,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 293021869, now seen corresponding path program 1 times [2024-11-12 01:06:29,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:06:29,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029704772] [2024-11-12 01:06:29,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:06:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:06:29,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558124110] [2024-11-12 01:06:29,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:29,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:29,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:06:29,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 01:06:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:06:29,654 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:06:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:06:29,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:06:29,707 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:06:29,708 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:06:29,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 01:06:29,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:06:29,912 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 01:06:29,973 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:06:29,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:06:29 BoogieIcfgContainer [2024-11-12 01:06:29,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:06:29,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:06:29,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:06:29,976 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:06:29,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:25" (3/4) ... [2024-11-12 01:06:29,978 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:06:29,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:06:29,983 INFO L158 Benchmark]: Toolchain (without parser) took 5220.59ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 106.5MB in the beginning and 141.9MB in the end (delta: -35.5MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-12 01:06:29,983 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:06:29,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.92ms. Allocated memory is still 163.6MB. Free memory was 106.2MB in the beginning and 134.0MB in the end (delta: -27.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 01:06:29,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.24ms. Allocated memory is still 163.6MB. Free memory was 133.7MB in the beginning and 130.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:06:29,983 INFO L158 Benchmark]: Boogie Preprocessor took 44.36ms. Allocated memory is still 163.6MB. Free memory was 130.7MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:06:29,983 INFO L158 Benchmark]: RCFGBuilder took 390.15ms. Allocated memory is still 163.6MB. Free memory was 126.5MB in the beginning and 107.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 01:06:29,984 INFO L158 Benchmark]: TraceAbstraction took 4404.38ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 106.7MB in the beginning and 141.9MB in the end (delta: -35.2MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-12 01:06:29,984 INFO L158 Benchmark]: Witness Printer took 6.60ms. Allocated memory is still 216.0MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:06:29,985 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.14ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.92ms. Allocated memory is still 163.6MB. Free memory was 106.2MB in the beginning and 134.0MB in the end (delta: -27.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.24ms. Allocated memory is still 163.6MB. Free memory was 133.7MB in the beginning and 130.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.36ms. Allocated memory is still 163.6MB. Free memory was 130.7MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 390.15ms. Allocated memory is still 163.6MB. Free memory was 126.5MB in the beginning and 107.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4404.38ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 106.7MB in the beginning and 141.9MB in the end (delta: -35.2MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 6.60ms. Allocated memory is still 216.0MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double last_1_var_1_1 = 256.5; [L38] float last_1_var_1_8 = 5.25; [L39] signed long int last_1_var_1_11 = 4; [L40] unsigned short int last_1_var_1_14 = 10000; [L41] unsigned short int last_1_var_1_17 = 4; [L42] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L112] last_1_var_1_1 = var_1_1 [L113] last_1_var_1_8 = var_1_8 [L114] last_1_var_1_11 = var_1_11 [L115] last_1_var_1_14 = var_1_14 [L116] last_1_var_1_17 = var_1_17 [L117] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L94] var_1_4 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L95] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L96] var_1_5 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L97] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L98] var_1_7 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L99] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L100] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L100] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L101] var_1_16 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L102] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L103] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L103] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L104] var_1_19 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L105] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L106] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L106] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L107] var_1_20 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L108] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L109] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L109] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L128] RET updateVariables() [L129] CALL step() [L46] COND FALSE !(\read(var_1_2)) [L55] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L57] COND TRUE var_1_4 <= last_1_var_1_1 [L58] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4] [L62] COND TRUE ! var_1_2 [L63] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L67] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L72] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L72] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) [L75] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L82] COND TRUE (var_1_14 * var_1_17) >= var_1_11 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L83] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L120-L121] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1067 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1067 mSDsluCounter, 1757 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1041 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 698 IncrementalHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 716 mSDtfsCounter, 698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 575 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 2192 SizeOfPredicates, 12 NumberOfNonLiveVariables, 717 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1560/1560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 01:06:30,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c9e4d60c6de1cb08a2f723e9da560ca057ed252e0551052818f5b37c6c97569 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:06:31,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:06:31,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:06:31,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:06:31,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:06:31,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:06:31,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:06:31,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:06:31,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:06:31,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:06:31,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:06:31,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:06:31,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:06:31,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:06:31,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:06:31,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:06:31,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:06:31,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:06:31,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:06:31,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:06:31,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:06:31,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:06:31,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:06:31,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:06:31,900 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:06:31,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:06:31,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:06:31,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:06:31,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:06:31,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:06:31,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:06:31,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:06:31,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:06:31,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:06:31,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:06:31,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:06:31,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:06:31,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:06:31,909 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:06:31,909 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:06:31,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:06:31,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:06:31,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:06:31,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:06:31,911 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c9e4d60c6de1cb08a2f723e9da560ca057ed252e0551052818f5b37c6c97569 [2024-11-12 01:06:32,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:06:32,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:06:32,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:06:32,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:06:32,186 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:06:32,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i [2024-11-12 01:06:33,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:06:33,586 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:06:33,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i [2024-11-12 01:06:33,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d9cd89c/a38c507fc1ca48119367cf2201d4a169/FLAGb3c139ec1 [2024-11-12 01:06:33,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d9cd89c/a38c507fc1ca48119367cf2201d4a169 [2024-11-12 01:06:33,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:06:33,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:06:33,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:06:33,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:06:33,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:06:33,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:33,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d87ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33, skipping insertion in model container [2024-11-12 01:06:33,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:33,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:06:33,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i[919,932] [2024-11-12 01:06:33,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:06:33,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:06:33,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-76.i[919,932] [2024-11-12 01:06:33,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:06:33,942 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:06:33,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33 WrapperNode [2024-11-12 01:06:33,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:06:33,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:06:33,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:06:33,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:06:33,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:33,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:33,983 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-12 01:06:33,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:06:33,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:06:33,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:06:33,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:06:33,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:33,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:33,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:34,012 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:06:34,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:34,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:34,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:34,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:34,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:34,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:34,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:06:34,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:06:34,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:06:34,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:06:34,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (1/1) ... [2024-11-12 01:06:34,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:06:34,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:06:34,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:06:34,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:06:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:06:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:06:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:06:34,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:06:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:06:34,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:06:34,174 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:06:34,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:06:47,025 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:06:47,025 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:06:47,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:06:47,035 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:06:47,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:47 BoogieIcfgContainer [2024-11-12 01:06:47,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:06:47,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:06:47,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:06:47,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:06:47,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:06:33" (1/3) ... [2024-11-12 01:06:47,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc651aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:06:47, skipping insertion in model container [2024-11-12 01:06:47,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33" (2/3) ... [2024-11-12 01:06:47,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc651aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:06:47, skipping insertion in model container [2024-11-12 01:06:47,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:47" (3/3) ... [2024-11-12 01:06:47,041 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-76.i [2024-11-12 01:06:47,053 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:06:47,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:06:47,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:06:47,106 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;@214003dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:06:47,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:06:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 01:06:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 01:06:47,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:47,118 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:47,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:47,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1908447088, now seen corresponding path program 1 times [2024-11-12 01:06:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:06:47,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592042701] [2024-11-12 01:06:47,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:06:47,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:06:47,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:06:47,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 01:06:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:47,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:06:47,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:06:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-12 01:06:47,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:06:47,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:06:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592042701] [2024-11-12 01:06:47,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592042701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:47,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:06:47,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:06:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066986311] [2024-11-12 01:06:47,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:47,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:06:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:06:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:06:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:06:47,919 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:06:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:47,941 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. [2024-11-12 01:06:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:06:47,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2024-11-12 01:06:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:47,950 INFO L225 Difference]: With dead ends: 97 [2024-11-12 01:06:47,950 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 01:06:47,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:06:47,957 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:47,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:06:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 01:06:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-12 01:06:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 01:06:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2024-11-12 01:06:47,993 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 89 [2024-11-12 01:06:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:47,993 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2024-11-12 01:06:47,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:06:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-11-12 01:06:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 01:06:47,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:47,997 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:48,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 01:06:48,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:06:48,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:48,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -928659274, now seen corresponding path program 1 times [2024-11-12 01:06:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:06:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3775004] [2024-11-12 01:06:48,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:48,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:06:48,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:06:48,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:06:48,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 01:06:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:48,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 01:06:48,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:06:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:06:50,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:06:50,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:06:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3775004] [2024-11-12 01:06:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3775004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:06:50,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:06:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:06:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966793334] [2024-11-12 01:06:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:06:50,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:06:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:06:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:06:50,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:06:50,689 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:54,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:06:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:06:54,652 INFO L93 Difference]: Finished difference Result 138 states and 210 transitions. [2024-11-12 01:06:54,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:06:54,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-11-12 01:06:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:06:54,733 INFO L225 Difference]: With dead ends: 138 [2024-11-12 01:06:54,733 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 01:06:54,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:06:54,735 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-12 01:06:54,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-12 01:06:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 01:06:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-12 01:06:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:06:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-11-12 01:06:54,760 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 89 [2024-11-12 01:06:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:06:54,761 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-11-12 01:06:54,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:06:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-11-12 01:06:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 01:06:54,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:06:54,764 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:06:54,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 01:06:54,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:06:54,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:06:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:06:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash 846348088, now seen corresponding path program 1 times [2024-11-12 01:06:54,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:06:54,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780773588] [2024-11-12 01:06:54,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:06:54,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-11-12 01:06:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:06:54,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:06:54,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 01:06:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:06:55,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 01:06:55,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:07:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:07:01,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:07:01,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:07:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780773588] [2024-11-12 01:07:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780773588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:07:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:07:01,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:07:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274338495] [2024-11-12 01:07:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:07:01,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 01:07:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:07:01,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 01:07:01,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:07:01,174 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:07:02,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:08,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:12,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:16,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:20,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:21,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:26,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:30,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:37,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:41,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:07:42,325 INFO L93 Difference]: Finished difference Result 566 states and 866 transitions. [2024-11-12 01:07:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 01:07:42,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-11-12 01:07:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:07:42,331 INFO L225 Difference]: With dead ends: 566 [2024-11-12 01:07:42,331 INFO L226 Difference]: Without dead ends: 478 [2024-11-12 01:07:42,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 01:07:42,334 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 383 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 113 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:07:42,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 455 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 296 Invalid, 7 Unknown, 0 Unchecked, 40.3s Time] [2024-11-12 01:07:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-12 01:07:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 319. [2024-11-12 01:07:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 220 states have (on average 1.440909090909091) internal successors, (317), 220 states have internal predecessors, (317), 91 states have call successors, (91), 7 states have call predecessors, (91), 7 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-12 01:07:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 499 transitions. [2024-11-12 01:07:42,406 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 499 transitions. Word has length 89 [2024-11-12 01:07:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:07:42,406 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 499 transitions. [2024-11-12 01:07:42,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:07:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 499 transitions. [2024-11-12 01:07:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 01:07:42,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:07:42,408 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:07:42,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 01:07:42,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:07:42,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:07:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:07:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash 453321078, now seen corresponding path program 1 times [2024-11-12 01:07:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:07:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873900015] [2024-11-12 01:07:42,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:07:42,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:07:42,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:07:42,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:07:42,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 01:07:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:07:43,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 01:07:43,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:07:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:07:47,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:07:47,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:07:47,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873900015] [2024-11-12 01:07:47,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873900015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:07:47,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:07:47,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:07:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231199627] [2024-11-12 01:07:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:07:47,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:07:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:07:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:07:47,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:07:47,248 INFO L87 Difference]: Start difference. First operand 319 states and 499 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:07:52,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:07:56,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:08:00,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:08:04,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []