./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_loopvsstraightlinecode_50-while_file-90.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 ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:19:43,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:43,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:19:43,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:43,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:19:43,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:43,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:19:43,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:19:43,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:19:43,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:19:43,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:43,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:19:43,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:43,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:43,536 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:19:43,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:43,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:43,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:43,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:19:43,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:43,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:43,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:43,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:43,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:43,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:43,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:43,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:43,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:43,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:43,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:19:43,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:19:43,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:19:43,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:43,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:43,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:43,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:43,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:19:43,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:19:43,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:19:43,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:19:43,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:19:43,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:19:43,552 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 -> ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193 [2024-11-09 00:19:43,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:43,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:43,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:43,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:43,888 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:43,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i [2024-11-09 00:19:45,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:45,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:45,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i [2024-11-09 00:19:45,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10552234/1d79da9645e34b21a38c357f276566cf/FLAG4145eea2c [2024-11-09 00:19:46,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10552234/1d79da9645e34b21a38c357f276566cf [2024-11-09 00:19:46,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:46,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:46,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:46,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:46,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:46,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518fb40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46, skipping insertion in model container [2024-11-09 00:19:46,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:46,298 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_loopvsstraightlinecode_50-while_file-90.i[915,928] [2024-11-09 00:19:46,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:46,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:46,372 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_loopvsstraightlinecode_50-while_file-90.i[915,928] [2024-11-09 00:19:46,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:46,416 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:46,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46 WrapperNode [2024-11-09 00:19:46,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:46,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:46,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:46,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:46,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,475 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-11-09 00:19:46,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:46,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:46,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:46,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:46,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,530 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-09 00:19:46,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:46,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:46,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:46,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:46,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (1/1) ... [2024-11-09 00:19:46,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:46,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:46,592 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-09 00:19:46,600 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-09 00:19:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:19:46,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:19:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:19:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:46,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:46,753 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:46,756 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:47,089 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:47,090 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:47,104 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:47,105 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:19:47,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:47 BoogieIcfgContainer [2024-11-09 00:19:47,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:47,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:19:47,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:19:47,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:19:47,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:46" (1/3) ... [2024-11-09 00:19:47,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be77f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:47, skipping insertion in model container [2024-11-09 00:19:47,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:46" (2/3) ... [2024-11-09 00:19:47,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be77f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:47, skipping insertion in model container [2024-11-09 00:19:47,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:47" (3/3) ... [2024-11-09 00:19:47,114 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-90.i [2024-11-09 00:19:47,152 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:19:47,153 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:19:47,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:19:47,251 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;@3ac2d6a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:19:47,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:19:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 45 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:19:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 00:19:47,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:47,270 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:19:47,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -415182279, now seen corresponding path program 1 times [2024-11-09 00:19:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:47,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874998424] [2024-11-09 00:19:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:19:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:19:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:19:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:19:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 00:19:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:19:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 00:19:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:19:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 00:19:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:19:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 00:19:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:19:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 00:19:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:19:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:19:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:19:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:19:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:19:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:48,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874998424] [2024-11-09 00:19:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874998424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:19:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742869298] [2024-11-09 00:19:48,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:48,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:19:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:19:48,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:19:48,717 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 45 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:19:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:49,069 INFO L93 Difference]: Finished difference Result 182 states and 327 transitions. [2024-11-09 00:19:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:19:49,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-09 00:19:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:49,082 INFO L225 Difference]: With dead ends: 182 [2024-11-09 00:19:49,083 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 00:19:49,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:19:49,090 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 62 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:49,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 240 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:19:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 00:19:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2024-11-09 00:19:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 00:19:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2024-11-09 00:19:49,178 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 118 [2024-11-09 00:19:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:49,181 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2024-11-09 00:19:49,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:19:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2024-11-09 00:19:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 00:19:49,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:49,187 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:19:49,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:19:49,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:49,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1924515900, now seen corresponding path program 1 times [2024-11-09 00:19:49,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138835229] [2024-11-09 00:19:49,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:19:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:19:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:19:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:19:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 00:19:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:19:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 00:19:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:19:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 00:19:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:19:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 00:19:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:19:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 00:19:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:19:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:19:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:19:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:19:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:19:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138835229] [2024-11-09 00:19:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138835229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:49,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:49,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:19:49,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097933059] [2024-11-09 00:19:49,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:49,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:19:49,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:49,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:19:49,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:19:49,590 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:19:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:49,802 INFO L93 Difference]: Finished difference Result 254 states and 392 transitions. [2024-11-09 00:19:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:19:49,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-09 00:19:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:49,805 INFO L225 Difference]: With dead ends: 254 [2024-11-09 00:19:49,808 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 00:19:49,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:19:49,810 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:49,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 254 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:19:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 00:19:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2024-11-09 00:19:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 00:19:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2024-11-09 00:19:49,857 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 120 [2024-11-09 00:19:49,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:49,859 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2024-11-09 00:19:49,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:19:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2024-11-09 00:19:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 00:19:49,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:49,864 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:19:49,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:19:49,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:49,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 879350649, now seen corresponding path program 1 times [2024-11-09 00:19:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:49,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272356831] [2024-11-09 00:19:49,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:19:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:19:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:19:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:19:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 00:19:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:19:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 00:19:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:19:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 00:19:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:19:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 00:19:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:19:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 00:19:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:19:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:19:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:19:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:19:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-09 00:19:50,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:50,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272356831] [2024-11-09 00:19:50,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272356831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:19:50,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548101408] [2024-11-09 00:19:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:50,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:50,289 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-09 00:19:50,291 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-09 00:19:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 00:19:50,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:19:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-09 00:19:50,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:19:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 51 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-09 00:19:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548101408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:19:51,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:19:51,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2024-11-09 00:19:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330864153] [2024-11-09 00:19:51,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:19:51,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:19:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:19:51,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:19:51,211 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-09 00:19:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:51,585 INFO L93 Difference]: Finished difference Result 342 states and 498 transitions. [2024-11-09 00:19:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:19:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 122 [2024-11-09 00:19:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:51,593 INFO L225 Difference]: With dead ends: 342 [2024-11-09 00:19:51,593 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 00:19:51,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-11-09 00:19:51,595 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 206 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:51,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 165 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:19:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 00:19:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2024-11-09 00:19:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 00:19:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 279 transitions. [2024-11-09 00:19:51,659 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 279 transitions. Word has length 122 [2024-11-09 00:19:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:51,660 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 279 transitions. [2024-11-09 00:19:51,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-09 00:19:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 279 transitions. [2024-11-09 00:19:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 00:19:51,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:51,662 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:19:51,684 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-09 00:19:51,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:51,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:51,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash 292544635, now seen corresponding path program 1 times [2024-11-09 00:19:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:51,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174093910] [2024-11-09 00:19:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:19:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93494162] [2024-11-09 00:19:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:51,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:51,961 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-09 00:19:51,963 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-09 00:19:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:19:52,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:19:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:19:52,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:19:52,683 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:19:52,684 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:19:52,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:19:52,886 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,SelfDestructingSolverStorable3 [2024-11-09 00:19:52,890 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:19:52,986 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:19:52,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:19:52 BoogieIcfgContainer [2024-11-09 00:19:52,990 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:19:52,990 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:19:52,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:19:52,990 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:19:52,991 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:47" (3/4) ... [2024-11-09 00:19:52,994 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:19:52,995 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:19:52,998 INFO L158 Benchmark]: Toolchain (without parser) took 6925.50ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 108.5MB in the beginning and 183.1MB in the end (delta: -74.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,998 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:52,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.11ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 93.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.47ms. Allocated memory is still 163.6MB. Free memory was 93.4MB in the beginning and 90.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,999 INFO L158 Benchmark]: Boogie Preprocessor took 69.52ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 87.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:19:53,000 INFO L158 Benchmark]: RCFGBuilder took 551.74ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 67.5MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:19:53,002 INFO L158 Benchmark]: TraceAbstraction took 5881.80ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 66.6MB in the beginning and 184.1MB in the end (delta: -117.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:53,002 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 249.6MB. Free memory was 184.1MB in the beginning and 183.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:19:53,003 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.24ms. Allocated memory is still 163.6MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.11ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 93.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.47ms. Allocated memory is still 163.6MB. Free memory was 93.4MB in the beginning and 90.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.52ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 87.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 551.74ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 67.5MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5881.80ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 66.6MB in the beginning and 184.1MB in the end (delta: -117.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 249.6MB. Free memory was 184.1MB in the beginning and 183.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 128, overapproximation of bitwiseOr at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -32; [L23] signed long int var_1_3 = 10; [L24] signed long int var_1_4 = 64; [L25] unsigned short int var_1_11 = 64; [L26] unsigned short int var_1_12 = 8; [L27] unsigned short int var_1_13 = 5; [L28] signed short int var_1_14 = 8; [L29] unsigned short int var_1_15 = 62763; [L30] unsigned long int var_1_16 = 25; [L31] float var_1_18 = 63.25; [L32] unsigned char var_1_20 = 0; [L33] float var_1_21 = 7.8; [L34] float var_1_22 = 32.1; [L35] unsigned char var_1_23 = 0; [L36] signed long int var_1_24 = -16; [L37] signed long int last_1_var_1_1 = -32; [L38] unsigned short int last_1_var_1_11 = 64; [L39] signed short int last_1_var_1_14 = 8; [L40] unsigned long int last_1_var_1_16 = 25; [L41] float last_1_var_1_18 = 63.25; VAL [isInitial=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L121] last_1_var_1_1 = var_1_1 [L122] last_1_var_1_11 = var_1_11 [L123] last_1_var_1_14 = var_1_14 [L124] last_1_var_1_16 = var_1_16 [L125] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L135] RET updateLastVariables() [L136] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L93] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L94] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L94] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L95] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L95] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L96] var_1_4 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L97] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L98] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L98] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L99] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L99] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L100] var_1_12 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L101] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L102] CALL assume_abort_if_not(var_1_12 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L102] RET assume_abort_if_not(var_1_12 <= 16384) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L103] var_1_13 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L104] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L105] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L105] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L106] var_1_15 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L107] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L108] CALL assume_abort_if_not(var_1_15 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L108] RET assume_abort_if_not(var_1_15 <= 65535) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L109] var_1_20 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L111] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L111] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L112] var_1_21 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L113] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L114] var_1_22 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L115] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L116] var_1_23 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L117] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L118] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L118] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L136] RET updateVariables() [L137] CALL step() [L45] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L45] COND FALSE !((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) [L52] var_1_1 = last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L54] COND FALSE !((- (- last_1_var_1_18)) != last_1_var_1_18) [L61] var_1_24 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L63] COND FALSE !(((var_1_15 - var_1_12) + var_1_24) < var_1_24) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L66] unsigned short int stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, stepLocal_0=-65535, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L67] COND FALSE !(var_1_24 < stepLocal_0) [L78] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L80] COND TRUE var_1_18 != (var_1_18 + var_1_18) [L81] var_1_11 = ((var_1_12 + var_1_13) + 32) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L83] COND FALSE !(((var_1_1 * var_1_4) + var_1_1) > var_1_1) [L88] var_1_16 = 0u VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L137] RET step() [L138] CALL, EXPR property() [L128] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L128-L129] return (((((((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) ? (((last_1_var_1_18 * last_1_var_1_18) < last_1_var_1_18) ? (var_1_1 == ((signed long int) last_1_var_1_11)) : (var_1_1 == ((signed long int) last_1_var_1_11))) : (var_1_1 == ((signed long int) last_1_var_1_11))) && ((var_1_18 != (var_1_18 + var_1_18)) ? (var_1_11 == ((unsigned short int) ((var_1_12 + var_1_13) + 32))) : 1)) && ((((var_1_15 - var_1_12) + var_1_24) < var_1_24) ? (var_1_14 == ((signed short int) var_1_12)) : 1)) && ((((var_1_1 * var_1_4) + var_1_1) > var_1_1) ? ((var_1_14 < var_1_1) ? (var_1_16 == ((unsigned long int) var_1_12)) : 1) : (var_1_16 == ((unsigned long int) 0u)))) && ((var_1_24 < var_1_13) ? (var_1_20 ? (var_1_18 == ((float) (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) + var_1_22))) : (var_1_23 ? (var_1_18 == ((float) (var_1_22 + var_1_21))) : (var_1_18 == ((float) -0.75f)))) : (var_1_18 == ((float) var_1_21)))) && (((- (- last_1_var_1_18)) != last_1_var_1_18) ? ((var_1_12 <= ((((last_1_var_1_14) > ((- last_1_var_1_14))) ? (last_1_var_1_14) : ((- last_1_var_1_14))))) ? (var_1_24 == ((signed long int) -50)) : (var_1_24 == ((signed long int) last_1_var_1_14))) : (var_1_24 == ((signed long int) last_1_var_1_14))) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=33, var_1_12=65536, var_1_13=-65535, var_1_14=8, var_1_15=-32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 659 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 416 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 243 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 726 NumberOfCodeBlocks, 726 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 2568 SizeOfPredicates, 3 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2913/3060 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-09 00:19:53,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_50-while_file-90.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 ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:19:55,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:55,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:19:55,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:55,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:19:55,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:55,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:19:55,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:19:55,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:19:55,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:19:55,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:55,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:19:55,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:55,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:55,566 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:19:55,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:55,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:55,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:55,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:55,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:55,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:55,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:55,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:55,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:19:55,570 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:19:55,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:55,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:19:55,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:55,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:55,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:55,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:55,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:19:55,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:19:55,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:19:55,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:55,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:55,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:55,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:55,574 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:19:55,575 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:19:55,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:19:55,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:19:55,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:19:55,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:19:55,576 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 -> ea7df308032d06b1304a4a33893d142fbc642677e172fa30f17dc86e231db193 [2024-11-09 00:19:55,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:55,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:55,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:55,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:55,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:55,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i [2024-11-09 00:19:57,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:57,730 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:57,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-90.i [2024-11-09 00:19:57,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec50b48fd/d9a9b1cb1cf04ec19be3519fa7b754d6/FLAGb3b43911a [2024-11-09 00:19:57,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec50b48fd/d9a9b1cb1cf04ec19be3519fa7b754d6 [2024-11-09 00:19:57,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:57,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:57,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:57,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:57,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:57,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:57,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71670085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57, skipping insertion in model container [2024-11-09 00:19:57,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:57,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:58,014 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_loopvsstraightlinecode_50-while_file-90.i[915,928] [2024-11-09 00:19:58,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:58,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:58,114 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_loopvsstraightlinecode_50-while_file-90.i[915,928] [2024-11-09 00:19:58,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:58,179 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:58,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58 WrapperNode [2024-11-09 00:19:58,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:58,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:58,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:58,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:58,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,246 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-09 00:19:58,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:58,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:58,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:58,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:58,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,279 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-09 00:19:58,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:58,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:58,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:58,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:58,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (1/1) ... [2024-11-09 00:19:58,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:58,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:58,362 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-09 00:19:58,365 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-09 00:19:58,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:58,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:19:58,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:19:58,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:19:58,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:58,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:58,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:58,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:59,502 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:59,502 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:59,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:59,519 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:19:59,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:59 BoogieIcfgContainer [2024-11-09 00:19:59,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:59,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:19:59,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:19:59,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:19:59,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:57" (1/3) ... [2024-11-09 00:19:59,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782d284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:59, skipping insertion in model container [2024-11-09 00:19:59,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:58" (2/3) ... [2024-11-09 00:19:59,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782d284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:59, skipping insertion in model container [2024-11-09 00:19:59,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:59" (3/3) ... [2024-11-09 00:19:59,530 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-90.i [2024-11-09 00:19:59,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:19:59,549 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:19:59,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:19:59,624 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;@714d0e7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:19:59,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:19:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:19:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 00:19:59,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:59,645 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:19:59,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:59,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1081310934, now seen corresponding path program 1 times [2024-11-09 00:19:59,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:19:59,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154931560] [2024-11-09 00:19:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:59,665 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-09 00:19:59,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:19:59,668 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-09 00:19:59,669 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-09 00:19:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:59,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:19:59,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:20:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-09 00:20:00,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:20:00,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:20:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154931560] [2024-11-09 00:20:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154931560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:20:00,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:20:00,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:20:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879663736] [2024-11-09 00:20:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:20:00,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:20:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:20:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:20:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:20:00,105 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:20:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:20:00,140 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2024-11-09 00:20:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:20:00,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-09 00:20:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:20:00,151 INFO L225 Difference]: With dead ends: 109 [2024-11-09 00:20:00,151 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 00:20:00,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-09 00:20:00,159 INFO L432 NwaCegarLoop]: 82 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, 82 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-09 00:20:00,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:20:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 00:20:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-09 00:20:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:20:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2024-11-09 00:20:00,203 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 115 [2024-11-09 00:20:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:20:00,203 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2024-11-09 00:20:00,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:20:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2024-11-09 00:20:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 00:20:00,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:20:00,211 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:20:00,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:20:00,412 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-09 00:20:00,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:20:00,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:20:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash -513398942, now seen corresponding path program 1 times [2024-11-09 00:20:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:20:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159504720] [2024-11-09 00:20:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:20:00,415 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-09 00:20:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:20:00,418 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-09 00:20:00,419 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-09 00:20:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:00,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 00:20:00,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:20:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-09 00:20:01,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:20:02,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:20:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159504720] [2024-11-09 00:20:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159504720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:20:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [352158877] [2024-11-09 00:20:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:20:02,133 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:20:02,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:20:02,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:20:02,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 00:20:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:03,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:20:03,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:20:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-09 00:20:04,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:20:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 00:20:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [352158877] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:20:07,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:20:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2024-11-09 00:20:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035067109] [2024-11-09 00:20:07,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:20:07,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 00:20:07,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:20:07,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 00:20:07,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-09 00:20:07,439 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 7 states have call successors, (54), 6 states have call predecessors, (54), 10 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) [2024-11-09 00:20:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:20:41,305 INFO L93 Difference]: Finished difference Result 560 states and 794 transitions. [2024-11-09 00:20:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-09 00:20:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 7 states have call successors, (54), 6 states have call predecessors, (54), 10 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) Word has length 115 [2024-11-09 00:20:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:20:41,318 INFO L225 Difference]: With dead ends: 560 [2024-11-09 00:20:41,318 INFO L226 Difference]: Without dead ends: 509 [2024-11-09 00:20:41,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3392 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=2110, Invalid=7592, Unknown=0, NotChecked=0, Total=9702 [2024-11-09 00:20:41,325 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1256 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-09 00:20:41,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 322 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-11-09 00:20:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-09 00:20:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 147. [2024-11-09 00:20:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 98 states have internal predecessors, (128), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 00:20:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2024-11-09 00:20:41,403 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 115 [2024-11-09 00:20:41,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:20:41,404 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2024-11-09 00:20:41,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 7 states have call successors, (54), 6 states have call predecessors, (54), 10 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) [2024-11-09 00:20:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2024-11-09 00:20:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 00:20:41,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:20:41,407 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:20:41,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 00:20:41,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:20:41,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-09 00:20:41,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:20:41,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:20:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash 109401126, now seen corresponding path program 1 times [2024-11-09 00:20:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:20:41,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379516596] [2024-11-09 00:20:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:20:41,811 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-09 00:20:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:20:41,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:20:41,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:20:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:42,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 00:20:42,247 INFO L278 TraceCheckSpWp]: Computing forward predicates...