./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_functionizing_file-6.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 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:32:17,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:32:17,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 18:32:17,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:32:17,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:32:17,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:32:17,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:32:17,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:32:17,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:32:17,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:32:17,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:32:17,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:32:17,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:32:17,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:32:17,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:32:17,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:32:17,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:32:17,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 18:32:17,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 18:32:17,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 18:32:17,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:32:17,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:32:17,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:32:17,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:32:17,147 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:32:17,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 18:32:17,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:32:17,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:32:17,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:32:17,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:32:17,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:32:17,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:32:17,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:32:17,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:32:17,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:32:17,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:32:17,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 18:32:17,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 18:32:17,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:32:17,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:32:17,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:32:17,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:32:17,152 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 -> 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 [2024-11-18 18:32:17,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:32:17,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:32:17,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:32:17,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:32:17,474 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:32:17,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-11-18 18:32:19,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:32:19,211 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:32:19,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-11-18 18:32:19,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9e4e2f4/ec764590e0e64dc5a299467dcd50f011/FLAG60588e589 [2024-11-18 18:32:19,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9e4e2f4/ec764590e0e64dc5a299467dcd50f011 [2024-11-18 18:32:19,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:32:19,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:32:19,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:32:19,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:32:19,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:32:19,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eee7ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19, skipping insertion in model container [2024-11-18 18:32:19,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:32:19,487 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_functionizing_file-6.i[919,932] [2024-11-18 18:32:19,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:32:19,588 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:32:19,604 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_functionizing_file-6.i[919,932] [2024-11-18 18:32:19,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:32:19,655 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:32:19,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19 WrapperNode [2024-11-18 18:32:19,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:32:19,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:32:19,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:32:19,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:32:19,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,732 INFO L138 Inliner]: procedures = 31, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 152 [2024-11-18 18:32:19,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:32:19,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:32:19,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:32:19,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:32:19,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,770 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-18 18:32:19,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:32:19,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:32:19,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:32:19,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:32:19,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (1/1) ... [2024-11-18 18:32:19,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:32:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:19,843 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-18 18:32:19,847 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-18 18:32:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:32:19,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 18:32:19,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 18:32:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 18:32:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:32:19,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:32:19,996 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:32:19,999 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:32:20,320 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-18 18:32:20,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:32:20,332 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:32:20,333 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:32:20,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:32:20 BoogieIcfgContainer [2024-11-18 18:32:20,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:32:20,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:32:20,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:32:20,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:32:20,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:32:19" (1/3) ... [2024-11-18 18:32:20,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479d9972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:32:20, skipping insertion in model container [2024-11-18 18:32:20,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:19" (2/3) ... [2024-11-18 18:32:20,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479d9972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:32:20, skipping insertion in model container [2024-11-18 18:32:20,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:32:20" (3/3) ... [2024-11-18 18:32:20,341 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-6.i [2024-11-18 18:32:20,353 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:32:20,354 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:32:20,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:32:20,421 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;@4d34d3ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:32:20,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:32:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 18:32:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-18 18:32:20,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:20,439 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:32:20,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:20,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash -812521492, now seen corresponding path program 1 times [2024-11-18 18:32:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22219858] [2024-11-18 18:32:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-18 18:32:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22219858] [2024-11-18 18:32:20,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22219858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496046071] [2024-11-18 18:32:20,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:20,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:20,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:20,812 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-18 18:32:20,814 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-18 18:32:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:21,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 18:32:21,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-18 18:32:21,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:32:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496046071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:21,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 18:32:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 18:32:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032789006] [2024-11-18 18:32:21,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:21,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 18:32:21,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:21,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 18:32:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 18:32:21,109 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 18:32:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:21,133 INFO L93 Difference]: Finished difference Result 123 states and 203 transitions. [2024-11-18 18:32:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 18:32:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-18 18:32:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:21,146 INFO L225 Difference]: With dead ends: 123 [2024-11-18 18:32:21,147 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 18:32:21,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-18 18:32:21,156 INFO L432 NwaCegarLoop]: 88 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, 88 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-18 18:32:21,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:32:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 18:32:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-18 18:32:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 18:32:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-18 18:32:21,198 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 126 [2024-11-18 18:32:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:21,198 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-18 18:32:21,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 18:32:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-18 18:32:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-18 18:32:21,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:21,204 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:32:21,223 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-18 18:32:21,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 18:32:21,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:21,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1984651882, now seen corresponding path program 1 times [2024-11-18 18:32:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:21,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419333785] [2024-11-18 18:32:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-18 18:32:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 18:32:22,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419333785] [2024-11-18 18:32:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419333785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:32:22,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082335139] [2024-11-18 18:32:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:22,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:22,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:22,415 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-18 18:32:22,417 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-18 18:32:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:22,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 18:32:22,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 437 proven. 39 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-18 18:32:22,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:32:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 63 proven. 42 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-18 18:32:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082335139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 18:32:23,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 18:32:23,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-11-18 18:32:23,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903618553] [2024-11-18 18:32:23,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 18:32:23,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 18:32:23,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 18:32:23,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 18:32:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-18 18:32:23,308 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-18 18:32:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:23,955 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2024-11-18 18:32:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 18:32:23,956 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 126 [2024-11-18 18:32:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:23,958 INFO L225 Difference]: With dead ends: 137 [2024-11-18 18:32:23,958 INFO L226 Difference]: Without dead ends: 79 [2024-11-18 18:32:23,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=697, Unknown=0, NotChecked=0, Total=992 [2024-11-18 18:32:23,961 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 84 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 18:32:23,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 154 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 18:32:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-18 18:32:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-11-18 18:32:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 18:32:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-11-18 18:32:23,979 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 126 [2024-11-18 18:32:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-11-18 18:32:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-18 18:32:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-11-18 18:32:23,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-18 18:32:23,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:23,982 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:32:24,002 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-18 18:32:24,183 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,SelfDestructingSolverStorable1 [2024-11-18 18:32:24,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:24,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash 716240933, now seen corresponding path program 1 times [2024-11-18 18:32:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 18:32:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890152264] [2024-11-18 18:32:24,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 18:32:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 18:32:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782340634] [2024-11-18 18:32:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:24,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:24,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:24,315 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-18 18:32:24,317 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-18 18:32:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:32:24,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 18:32:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 18:32:24,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 18:32:24,555 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 18:32:24,556 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 18:32:24,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 18:32:24,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 18:32:24,762 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 18:32:24,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 18:32:24,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:32:24 BoogieIcfgContainer [2024-11-18 18:32:24,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 18:32:24,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 18:32:24,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 18:32:24,861 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 18:32:24,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:32:20" (3/4) ... [2024-11-18 18:32:24,864 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 18:32:24,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 18:32:24,866 INFO L158 Benchmark]: Toolchain (without parser) took 5620.43ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 100.2MB in the beginning and 102.1MB in the end (delta: -1.9MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2024-11-18 18:32:24,866 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:32:24,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.53ms. Allocated memory is still 159.4MB. Free memory was 100.2MB in the beginning and 84.2MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 18:32:24,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.35ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 80.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 18:32:24,868 INFO L158 Benchmark]: Boogie Preprocessor took 57.92ms. Allocated memory is still 159.4MB. Free memory was 80.9MB in the beginning and 77.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 18:32:24,868 INFO L158 Benchmark]: RCFGBuilder took 541.60ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 77.5MB in the beginning and 190.1MB in the end (delta: -112.6MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-18 18:32:24,869 INFO L158 Benchmark]: TraceAbstraction took 4524.74ms. Allocated memory is still 226.5MB. Free memory was 189.1MB in the beginning and 102.1MB in the end (delta: 87.0MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2024-11-18 18:32:24,869 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 226.5MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 18:32:24,872 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.19ms. Allocated memory is still 159.4MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.53ms. Allocated memory is still 159.4MB. Free memory was 100.2MB in the beginning and 84.2MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.35ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 80.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.92ms. Allocated memory is still 159.4MB. Free memory was 80.9MB in the beginning and 77.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 541.60ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 77.5MB in the beginning and 190.1MB in the end (delta: -112.6MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4524.74ms. Allocated memory is still 226.5MB. Free memory was 189.1MB in the beginning and 102.1MB in the end (delta: 87.0MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 226.5MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryArithmeticFLOAToperation at line 59. Possible FailurePath: [L26] unsigned char isInitial = 0; [L27] double var_1_1 = 100.25; [L28] unsigned char var_1_2 = 0; [L29] unsigned char var_1_3 = 8; [L30] unsigned char var_1_4 = 0; [L31] double var_1_5 = 1.9; [L32] double var_1_6 = 7.5; [L33] double var_1_7 = 64.25; [L34] signed long int var_1_8 = 2; [L35] signed long int var_1_9 = 1000000000; [L36] signed long int var_1_10 = 1000000000; [L37] signed long int var_1_11 = 1957998270; [L38] float var_1_12 = 50.25; [L39] float var_1_13 = 9.8; [L40] float var_1_14 = 25.5; [L41] float var_1_15 = 3.5; [L42] signed long int var_1_16 = -500; [L43] unsigned char var_1_17 = 1; [L44] unsigned char var_1_18 = 1; [L45] unsigned char var_1_19 = 0; VAL [isInitial=0, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] FCALL updateLastVariables() [L142] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L101] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L101] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L102] var_1_3 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L104] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L104] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L105] var_1_4 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L106] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L107] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L107] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L108] var_1_5 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L109] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L110] var_1_6 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L111] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L112] var_1_7 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L113] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L114] var_1_9 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L115] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L116] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L116] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L117] var_1_10 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L118] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, var_1_10=536870912, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L119] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L119] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, var_1_10=536870912, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L120] var_1_11 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L121] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L122] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L122] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L123] var_1_14 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L124] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L125] var_1_15 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L126] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L127] var_1_18 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L128] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L129] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L129] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L142] RET updateVariables() [L143] CALL step() [L82] CALL functionized0(var_1_7, 4.125) [L47] COND FALSE !(\read(var_1_2)) [L54] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_5=3, var_1_7=2, var_1_8=2, var_1_9=536870911] [L82] RET functionized0(var_1_7, 4.125) [L83] var_1_8 = (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L84] COND TRUE ((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11) [L85] var_1_12 = var_1_7 VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L87] CALL functionized1(var_1_8, var_1_15, var_1_14) [L58] COND TRUE functionized1_localFunctionVar0 < var_1_11 [L59] var_1_13 = ((7.3868261718112563E18f - (functionized1_localFunctionVar2 + functionized1_localFunctionVar1)) - 5.4f) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L87] RET functionized1(var_1_8, var_1_15, var_1_14) [L88] CALL functionized2(var_1_6, var_1_5, var_1_13) [L65] COND FALSE !((((((- var_1_15)) > ((functionized2_localFunctionVar2 * functionized2_localFunctionVar0))) ? ((- var_1_15)) : ((functionized2_localFunctionVar2 * functionized2_localFunctionVar0)))) < functionized2_localFunctionVar1) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L88] RET functionized2(var_1_6, var_1_5, var_1_13) [L89] CALL functionized3(var_1_16, var_1_8, var_1_18, var_1_9) [L74] var_1_17 = (((var_1_3 * functionized3_localFunctionVar3) >= ((((functionized3_localFunctionVar0) > (functionized3_localFunctionVar1)) ? (functionized3_localFunctionVar0) : (functionized3_localFunctionVar1)))) || functionized3_localFunctionVar2) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L89] RET functionized3(var_1_16, var_1_8, var_1_18, var_1_9) [L90] COND TRUE \read(var_1_17) [L91] CALL, EXPR functionized4() [L77] return (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375)); VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L91] RET, EXPR functionized4() [L91] COND TRUE var_1_7 > functionized4() [L92] var_1_19 = var_1_18 VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L143] RET step() [L144] CALL, EXPR property() [L134-L135] return ((((((var_1_2 ? ((var_1_3 >= var_1_4) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_8 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((var_1_13 * var_1_6))) ? ((- var_1_15)) : ((var_1_13 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((var_1_8) < (var_1_10)) ? (var_1_8) : (var_1_10)))) ? (var_1_2 ? (var_1_16 == ((signed long int) var_1_3)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_3 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, var_1_10=536870912, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 143 mSDtfsCounter, 174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=2, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 1166 SizeOfPredicates, 7 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3300/3420 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-18 18:32:24,900 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_functionizing_file-6.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 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 18:32:27,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 18:32:27,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 18:32:27,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 18:32:27,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 18:32:27,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 18:32:27,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 18:32:27,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 18:32:27,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 18:32:27,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 18:32:27,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 18:32:27,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 18:32:27,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 18:32:27,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 18:32:27,184 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 18:32:27,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 18:32:27,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 18:32:27,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 18:32:27,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 18:32:27,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 18:32:27,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 18:32:27,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 18:32:27,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 18:32:27,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 18:32:27,190 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 18:32:27,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 18:32:27,191 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 18:32:27,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 18:32:27,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 18:32:27,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 18:32:27,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 18:32:27,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 18:32:27,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 18:32:27,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 18:32:27,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:32:27,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 18:32:27,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 18:32:27,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 18:32:27,202 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 18:32:27,202 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 18:32:27,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 18:32:27,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 18:32:27,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 18:32:27,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 18:32:27,203 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 -> 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 [2024-11-18 18:32:27,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 18:32:27,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 18:32:27,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 18:32:27,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 18:32:27,527 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 18:32:27,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-11-18 18:32:29,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 18:32:29,723 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 18:32:29,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-11-18 18:32:29,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff13979e1/b6accae2c2a3484a87ad1cb9692fbdf7/FLAG3c1c9ccbb [2024-11-18 18:32:29,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff13979e1/b6accae2c2a3484a87ad1cb9692fbdf7 [2024-11-18 18:32:29,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 18:32:29,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 18:32:29,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 18:32:29,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 18:32:29,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 18:32:29,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:32:29" (1/1) ... [2024-11-18 18:32:29,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46674559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:29, skipping insertion in model container [2024-11-18 18:32:29,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:32:29" (1/1) ... [2024-11-18 18:32:29,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 18:32:30,003 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_functionizing_file-6.i[919,932] [2024-11-18 18:32:30,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:32:30,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 18:32:30,102 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_functionizing_file-6.i[919,932] [2024-11-18 18:32:30,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 18:32:30,160 INFO L204 MainTranslator]: Completed translation [2024-11-18 18:32:30,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30 WrapperNode [2024-11-18 18:32:30,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 18:32:30,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 18:32:30,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 18:32:30,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 18:32:30,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,227 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 149 [2024-11-18 18:32:30,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 18:32:30,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 18:32:30,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 18:32:30,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 18:32:30,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,267 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-18 18:32:30,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 18:32:30,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 18:32:30,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 18:32:30,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 18:32:30,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (1/1) ... [2024-11-18 18:32:30,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 18:32:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 18:32:30,338 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-18 18:32:30,340 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-18 18:32:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 18:32:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 18:32:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 18:32:30,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 18:32:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 18:32:30,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 18:32:30,487 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 18:32:30,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 18:32:49,163 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-18 18:32:49,165 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 18:32:49,181 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 18:32:49,182 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 18:32:49,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:32:49 BoogieIcfgContainer [2024-11-18 18:32:49,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 18:32:49,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 18:32:49,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 18:32:49,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 18:32:49,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:32:29" (1/3) ... [2024-11-18 18:32:49,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538b6bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:32:49, skipping insertion in model container [2024-11-18 18:32:49,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:32:30" (2/3) ... [2024-11-18 18:32:49,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538b6bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:32:49, skipping insertion in model container [2024-11-18 18:32:49,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:32:49" (3/3) ... [2024-11-18 18:32:49,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-6.i [2024-11-18 18:32:49,206 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 18:32:49,207 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 18:32:49,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 18:32:49,276 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;@2709327a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 18:32:49,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 18:32:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 18:32:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-18 18:32:49,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:49,291 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:32:49,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash -812521492, now seen corresponding path program 1 times [2024-11-18 18:32:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:32:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106962003] [2024-11-18 18:32:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:49,307 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-18 18:32:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:32:49,327 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-18 18:32:49,329 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-18 18:32:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:50,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 18:32:50,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-18 18:32:50,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:32:50,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:32:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106962003] [2024-11-18 18:32:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106962003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:50,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:32:50,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 18:32:50,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873160038] [2024-11-18 18:32:50,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:50,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 18:32:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 18:32:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 18:32:50,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 18:32:50,559 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 18:32:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:32:50,596 INFO L93 Difference]: Finished difference Result 123 states and 203 transitions. [2024-11-18 18:32:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 18:32:50,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-18 18:32:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:32:50,606 INFO L225 Difference]: With dead ends: 123 [2024-11-18 18:32:50,607 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 18:32:50,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-18 18:32:50,616 INFO L432 NwaCegarLoop]: 88 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, 88 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-18 18:32:50,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 18:32:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 18:32:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-18 18:32:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 18:32:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-18 18:32:50,656 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 126 [2024-11-18 18:32:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:32:50,657 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-18 18:32:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 18:32:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-18 18:32:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-18 18:32:50,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:32:50,661 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:32:50,701 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-18 18:32:50,861 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-18 18:32:50,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:32:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:32:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1984651882, now seen corresponding path program 1 times [2024-11-18 18:32:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:32:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293486891] [2024-11-18 18:32:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:32:50,864 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-18 18:32:50,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:32:50,866 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-18 18:32:50,867 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-18 18:32:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:32:51,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 18:32:51,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:32:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 18:32:54,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 18:32:54,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:32:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293486891] [2024-11-18 18:32:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293486891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 18:32:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 18:32:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 18:32:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453276020] [2024-11-18 18:32:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 18:32:54,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 18:32:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 18:32:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 18:32:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-18 18:32:54,489 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 18:33:02,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:06,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:10,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:11,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:16,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:20,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:24,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:28,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:32,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 18:33:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 18:33:32,142 INFO L93 Difference]: Finished difference Result 129 states and 181 transitions. [2024-11-18 18:33:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 18:33:32,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-18 18:33:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 18:33:32,262 INFO L225 Difference]: With dead ends: 129 [2024-11-18 18:33:32,263 INFO L226 Difference]: Without dead ends: 71 [2024-11-18 18:33:32,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-18 18:33:32,265 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 77 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2024-11-18 18:33:32,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 194 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 150 Invalid, 8 Unknown, 0 Unchecked, 36.2s Time] [2024-11-18 18:33:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-18 18:33:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-18 18:33:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 18:33:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2024-11-18 18:33:32,286 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 126 [2024-11-18 18:33:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 18:33:32,287 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2024-11-18 18:33:32,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 18:33:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2024-11-18 18:33:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-18 18:33:32,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 18:33:32,303 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 18:33:32,427 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-18 18:33:32,503 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-18 18:33:32,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 18:33:32,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 18:33:32,505 INFO L85 PathProgramCache]: Analyzing trace with hash -294876317, now seen corresponding path program 1 times [2024-11-18 18:33:32,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 18:33:32,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266445276] [2024-11-18 18:33:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:33:32,506 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-18 18:33:32,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 18:33:32,508 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-18 18:33:32,509 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-18 18:33:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:33:33,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 18:33:33,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:33:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 437 proven. 39 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-18 18:33:37,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:33:39,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 18:33:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266445276] [2024-11-18 18:33:39,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266445276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:33:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1852774741] [2024-11-18 18:33:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 18:33:39,565 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 18:33:39,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 18:33:39,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-18 18:33:39,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-18 18:33:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 18:33:42,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 18:33:42,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 18:33:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 428 proven. 57 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-18 18:33:48,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 18:33:49,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1852774741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 18:33:49,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 18:33:49,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 12 [2024-11-18 18:33:49,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693867304] [2024-11-18 18:33:49,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 18:33:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 18:33:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 18:33:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 18:33:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-18 18:33:49,943 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 5 states have call successors, (27), 5 states have call predecessors, (27), 8 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28)