./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:23:52,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:23:52,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:23:52,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:23:52,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:23:52,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:23:52,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:23:52,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:23:52,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:23:52,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:23:52,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:23:52,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:23:52,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:23:52,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:23:52,534 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:23:52,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:23:52,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:23:52,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:23:52,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:23:52,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:23:52,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:23:52,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:23:52,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:23:52,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:23:52,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:23:52,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:23:52,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:23:52,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:23:52,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:23:52,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:23:52,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:23:52,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:23:52,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:23:52,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:23:52,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:23:52,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:23:52,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:23:52,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:23:52,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:23:52,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:23:52,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:23:52,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:23:52,546 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2024-11-12 05:23:52,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:23:52,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:23:52,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:23:52,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:23:52,822 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:23:52,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-12 05:23:54,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:23:54,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:23:54,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-12 05:23:54,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7c9c7e0/80daea7041a04fa39b698fd09f2d8fda/FLAG9b2b1977f [2024-11-12 05:23:54,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7c9c7e0/80daea7041a04fa39b698fd09f2d8fda [2024-11-12 05:23:54,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:23:54,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:23:54,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:23:54,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:23:54,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:23:54,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:54,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9453f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54, skipping insertion in model container [2024-11-12 05:23:54,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:54,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:23:54,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-11-12 05:23:54,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:23:54,869 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:23:54,880 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_25-1loop_file-70.i[915,928] [2024-11-12 05:23:54,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:23:54,917 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:23:54,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54 WrapperNode [2024-11-12 05:23:54,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:23:54,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:23:54,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:23:54,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:23:54,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:54,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:54,980 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-12 05:23:54,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:23:54,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:23:54,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:23:54,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:23:54,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:54,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:54,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:55,018 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:23:55,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:55,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:55,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:55,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:55,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:55,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:55,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:23:55,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:23:55,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:23:55,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:23:55,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (1/1) ... [2024-11-12 05:23:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:23:55,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:23:55,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:23:55,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:23:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:23:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:23:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:23:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:23:55,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:23:55,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:23:55,235 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:23:55,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:23:55,628 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 05:23:55,628 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:23:55,640 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:23:55,640 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:23:55,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:23:55 BoogieIcfgContainer [2024-11-12 05:23:55,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:23:55,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:23:55,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:23:55,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:23:55,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:23:54" (1/3) ... [2024-11-12 05:23:55,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ec5633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:23:55, skipping insertion in model container [2024-11-12 05:23:55,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:54" (2/3) ... [2024-11-12 05:23:55,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ec5633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:23:55, skipping insertion in model container [2024-11-12 05:23:55,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:23:55" (3/3) ... [2024-11-12 05:23:55,649 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-12 05:23:55,664 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:23:55,665 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:23:55,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:23:55,727 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;@2b1973ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:23:55,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:23:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:23:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 05:23:55,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:55,743 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:23:55,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:55,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:55,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1153718418, now seen corresponding path program 1 times [2024-11-12 05:23:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:23:55,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973145978] [2024-11-12 05:23:55,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:23:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:23:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:23:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:23:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:23:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:23:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:23:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:23:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:23:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:23:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:23:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:23:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:23:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:23:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 05:23:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:23:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973145978] [2024-11-12 05:23:56,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973145978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:23:56,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:23:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:23:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885230546] [2024-11-12 05:23:56,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:23:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:23:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:23:56,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:23:56,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:23:56,126 INFO L87 Difference]: Start difference. First operand has 60 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 05:23:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:23:56,148 INFO L93 Difference]: Finished difference Result 117 states and 182 transitions. [2024-11-12 05:23:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:23:56,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-12 05:23:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:23:56,155 INFO L225 Difference]: With dead ends: 117 [2024-11-12 05:23:56,156 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 05:23:56,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:23:56,162 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:23:56,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:23:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 05:23:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 05:23:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:23:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-11-12 05:23:56,203 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 90 [2024-11-12 05:23:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:23:56,203 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-11-12 05:23:56,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 05:23:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-11-12 05:23:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 05:23:56,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:56,211 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:23:56,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:23:56,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:56,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash 895368340, now seen corresponding path program 1 times [2024-11-12 05:23:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:23:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595461099] [2024-11-12 05:23:56,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:23:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:23:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:23:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:23:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:23:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:23:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:23:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:23:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:23:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:23:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:23:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:23:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:23:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:23:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 05:23:57,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:23:57,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595461099] [2024-11-12 05:23:57,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595461099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:23:57,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:23:57,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 05:23:57,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59726479] [2024-11-12 05:23:57,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:23:57,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:23:57,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:23:57,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:23:57,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:23:57,681 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:23:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:23:58,309 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2024-11-12 05:23:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:23:58,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-12 05:23:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:23:58,313 INFO L225 Difference]: With dead ends: 198 [2024-11-12 05:23:58,314 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 05:23:58,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:23:58,318 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 254 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:23:58,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 232 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:23:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 05:23:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 62. [2024-11-12 05:23:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:23:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-11-12 05:23:58,338 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 90 [2024-11-12 05:23:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:23:58,342 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-11-12 05:23:58,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:23:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-12 05:23:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 05:23:58,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:58,347 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:23:58,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:23:58,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:58,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash -879639022, now seen corresponding path program 1 times [2024-11-12 05:23:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:23:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340026243] [2024-11-12 05:23:58,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:23:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:23:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:23:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:23:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:23:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:23:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:23:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:23:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:23:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:23:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:23:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:23:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:23:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:23:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 05:23:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:23:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340026243] [2024-11-12 05:23:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340026243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:23:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:23:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:23:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142372508] [2024-11-12 05:23:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:23:59,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:23:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:23:59,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:23:59,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:23:59,655 INFO L87 Difference]: Start difference. First operand 62 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:23:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:23:59,936 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2024-11-12 05:23:59,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:23:59,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-12 05:23:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:23:59,940 INFO L225 Difference]: With dead ends: 149 [2024-11-12 05:23:59,940 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 05:23:59,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:23:59,942 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:23:59,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:23:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 05:23:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2024-11-12 05:23:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:23:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2024-11-12 05:23:59,954 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 90 [2024-11-12 05:23:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:23:59,954 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2024-11-12 05:23:59,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:23:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2024-11-12 05:23:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 05:23:59,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:59,956 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:23:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:23:59,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:59,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash 308562326, now seen corresponding path program 1 times [2024-11-12 05:23:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:23:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087507520] [2024-11-12 05:23:59,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:23:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:24:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:24:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:24:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:24:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:24:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:24:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:24:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:24:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:24:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:24:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:24:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:24:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:24:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 05:24:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:24:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087507520] [2024-11-12 05:24:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087507520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:24:00,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:24:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:24:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554129840] [2024-11-12 05:24:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:24:00,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:24:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:24:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:24:00,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:24:00,132 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:24:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:24:00,169 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2024-11-12 05:24:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:24:00,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-12 05:24:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:24:00,171 INFO L225 Difference]: With dead ends: 157 [2024-11-12 05:24:00,171 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 05:24:00,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-12 05:24:00,173 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 31 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:24:00,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 278 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:24:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 05:24:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2024-11-12 05:24:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:24:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2024-11-12 05:24:00,187 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 90 [2024-11-12 05:24:00,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:24:00,189 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2024-11-12 05:24:00,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:24:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2024-11-12 05:24:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 05:24:00,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:00,191 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:00,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:24:00,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:00,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash -69887406, now seen corresponding path program 1 times [2024-11-12 05:24:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:24:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96789917] [2024-11-12 05:24:00,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:24:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:24:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:24:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:24:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:24:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:24:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:24:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:24:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:24:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:24:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:24:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:24:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:24:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:24:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-12 05:24:00,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:24:00,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96789917] [2024-11-12 05:24:00,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96789917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:24:00,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053930162] [2024-11-12 05:24:00,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:00,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:24:00,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:24:00,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:24:00,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:24:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:00,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 05:24:00,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:24:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 158 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 05:24:01,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:24:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-12 05:24:01,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053930162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:24:01,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:24:01,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 21 [2024-11-12 05:24:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719494929] [2024-11-12 05:24:01,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:24:01,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 05:24:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:24:01,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 05:24:01,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-12 05:24:01,459 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-12 05:24:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:24:01,942 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2024-11-12 05:24:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 05:24:01,942 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 93 [2024-11-12 05:24:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:24:01,944 INFO L225 Difference]: With dead ends: 179 [2024-11-12 05:24:01,944 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 05:24:01,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2024-11-12 05:24:01,946 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 209 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:24:01,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 392 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:24:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 05:24:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2024-11-12 05:24:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:24:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2024-11-12 05:24:01,968 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 93 [2024-11-12 05:24:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:24:01,969 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2024-11-12 05:24:01,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-12 05:24:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2024-11-12 05:24:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 05:24:01,973 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:01,973 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:01,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:24:02,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:24:02,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash 238150162, now seen corresponding path program 1 times [2024-11-12 05:24:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:24:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521146702] [2024-11-12 05:24:02,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:24:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:24:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:24:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:24:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:24:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:24:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:24:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:24:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:24:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:24:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:24:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:24:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:24:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:24:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 05:24:02,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:24:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521146702] [2024-11-12 05:24:02,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521146702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:24:02,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:24:02,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 05:24:02,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886197542] [2024-11-12 05:24:02,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:24:02,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 05:24:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:24:02,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 05:24:02,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:24:02,836 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:24:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:24:03,328 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions. [2024-11-12 05:24:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 05:24:03,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-12 05:24:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:24:03,334 INFO L225 Difference]: With dead ends: 189 [2024-11-12 05:24:03,334 INFO L226 Difference]: Without dead ends: 187 [2024-11-12 05:24:03,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-12 05:24:03,337 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 152 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:24:03,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 495 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:24:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-12 05:24:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111. [2024-11-12 05:24:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 92 states have internal predecessors, (116), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:24:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2024-11-12 05:24:03,360 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 93 [2024-11-12 05:24:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:24:03,360 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2024-11-12 05:24:03,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:24:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2024-11-12 05:24:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 05:24:03,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:03,361 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:03,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:24:03,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:03,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash 631177172, now seen corresponding path program 1 times [2024-11-12 05:24:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:24:03,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740733705] [2024-11-12 05:24:03,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:24:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:24:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:24:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:24:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:24:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:24:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:24:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:24:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:24:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:24:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:24:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:24:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:24:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:24:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 05:24:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:24:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740733705] [2024-11-12 05:24:04,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740733705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:24:04,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:24:04,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 05:24:04,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476056998] [2024-11-12 05:24:04,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:24:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:24:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:24:04,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:24:04,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:24:04,020 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:24:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:24:04,423 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2024-11-12 05:24:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 05:24:04,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-12 05:24:04,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:24:04,425 INFO L225 Difference]: With dead ends: 120 [2024-11-12 05:24:04,425 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 05:24:04,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:24:04,426 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:24:04,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 460 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:24:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 05:24:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2024-11-12 05:24:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 87 states have internal predecessors, (109), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:24:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2024-11-12 05:24:04,442 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 93 [2024-11-12 05:24:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:24:04,442 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2024-11-12 05:24:04,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 05:24:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2024-11-12 05:24:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 05:24:04,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:04,444 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:04,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 05:24:04,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:04,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash -204748978, now seen corresponding path program 1 times [2024-11-12 05:24:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:24:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970168697] [2024-11-12 05:24:04,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:24:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:24:04,502 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:24:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:24:04,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:24:04,568 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:24:04,569 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:24:04,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 05:24:04,573 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:04,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:24:04,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:24:04 BoogieIcfgContainer [2024-11-12 05:24:04,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:24:04,658 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:24:04,658 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:24:04,658 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:24:04,659 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:23:55" (3/4) ... [2024-11-12 05:24:04,661 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:24:04,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:24:04,663 INFO L158 Benchmark]: Toolchain (without parser) took 10062.77ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 89.5MB in the beginning and 216.8MB in the end (delta: -127.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:24:04,663 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:24:04,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.50ms. Allocated memory is still 159.4MB. Free memory was 89.5MB in the beginning and 75.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:24:04,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.18ms. Allocated memory is still 159.4MB. Free memory was 74.9MB in the beginning and 72.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:24:04,664 INFO L158 Benchmark]: Boogie Preprocessor took 73.12ms. Allocated memory is still 159.4MB. Free memory was 72.0MB in the beginning and 68.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:24:04,664 INFO L158 Benchmark]: RCFGBuilder took 586.19ms. Allocated memory is still 159.4MB. Free memory was 68.2MB in the beginning and 118.7MB in the end (delta: -50.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:24:04,664 INFO L158 Benchmark]: TraceAbstraction took 9014.63ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 118.1MB in the beginning and 217.8MB in the end (delta: -99.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-12 05:24:04,665 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 264.2MB. Free memory was 217.8MB in the beginning and 216.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:24:04,667 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.18ms. Allocated memory is still 121.6MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.50ms. Allocated memory is still 159.4MB. Free memory was 89.5MB in the beginning and 75.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.18ms. Allocated memory is still 159.4MB. Free memory was 74.9MB in the beginning and 72.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.12ms. Allocated memory is still 159.4MB. Free memory was 72.0MB in the beginning and 68.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 586.19ms. Allocated memory is still 159.4MB. Free memory was 68.2MB in the beginning and 118.7MB in the end (delta: -50.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9014.63ms. Allocated memory was 159.4MB in the beginning and 264.2MB in the end (delta: 104.9MB). Free memory was 118.1MB in the beginning and 217.8MB in the end (delta: -99.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 264.2MB. Free memory was 217.8MB in the beginning and 216.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; VAL [isInitial=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L81] isInitial = 1 [L82] FCALL initially() [L83] int k_loop; [L84] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L84] COND TRUE k_loop < 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L86] RET updateVariables() [L87] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L39] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) [L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=83/10, var_1_9=255] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L87] RET step() [L88] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 8, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 766 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 2100 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1594 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 506 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 217 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 816 ConstructedInterpolants, 0 QuantifiedInterpolants, 4061 SizeOfPredicates, 7 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 2718/2808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:24:04,705 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_25-1loop_file-70.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:24:06,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:24:06,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:24:06,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:24:06,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:24:07,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:24:07,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:24:07,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:24:07,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:24:07,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:24:07,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:24:07,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:24:07,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:24:07,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:24:07,041 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:24:07,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:24:07,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:24:07,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:24:07,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:24:07,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:24:07,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:24:07,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:24:07,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:24:07,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:24:07,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:24:07,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:24:07,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:24:07,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:24:07,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:24:07,047 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:24:07,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:24:07,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:24:07,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:24:07,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:24:07,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:24:07,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:24:07,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:24:07,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:24:07,057 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:24:07,057 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:24:07,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:24:07,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:24:07,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:24:07,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:24:07,060 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2024-11-12 05:24:07,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:24:07,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:24:07,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:24:07,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:24:07,391 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:24:07,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-12 05:24:09,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:24:09,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:24:09,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-12 05:24:09,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a43730a7/d3e8c5d1a76b45d09006ac3077b63dec/FLAG8738f62f7 [2024-11-12 05:24:09,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a43730a7/d3e8c5d1a76b45d09006ac3077b63dec [2024-11-12 05:24:09,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:24:09,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:24:09,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:24:09,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:24:09,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:24:09,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ebafe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09, skipping insertion in model container [2024-11-12 05:24:09,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:24:09,526 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_25-1loop_file-70.i[915,928] [2024-11-12 05:24:09,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:24:09,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:24:09,601 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_25-1loop_file-70.i[915,928] [2024-11-12 05:24:09,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:24:09,648 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:24:09,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09 WrapperNode [2024-11-12 05:24:09,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:24:09,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:24:09,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:24:09,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:24:09,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,700 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-12 05:24:09,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:24:09,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:24:09,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:24:09,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:24:09,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,744 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:24:09,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:24:09,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:24:09,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:24:09,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:24:09,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (1/1) ... [2024-11-12 05:24:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:24:09,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:24:09,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:24:09,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:24:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:24:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:24:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:24:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:24:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:24:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:24:09,921 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:24:09,924 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:24:10,150 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-12 05:24:10,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:24:10,184 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:24:10,186 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:24:10,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:24:10 BoogieIcfgContainer [2024-11-12 05:24:10,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:24:10,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:24:10,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:24:10,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:24:10,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:24:09" (1/3) ... [2024-11-12 05:24:10,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa53921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:24:10, skipping insertion in model container [2024-11-12 05:24:10,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:09" (2/3) ... [2024-11-12 05:24:10,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa53921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:24:10, skipping insertion in model container [2024-11-12 05:24:10,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:24:10" (3/3) ... [2024-11-12 05:24:10,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-12 05:24:10,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:24:10,214 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:24:10,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:24:10,290 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;@540105c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:24:10,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:24:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:24:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 05:24:10,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:10,304 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:10,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:10,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash 231096405, now seen corresponding path program 1 times [2024-11-12 05:24:10,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:24:10,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422390313] [2024-11-12 05:24:10,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:10,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:24:10,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:24:10,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:24:10,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:24:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:10,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:24:10,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:24:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 05:24:10,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:24:10,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:24:10,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422390313] [2024-11-12 05:24:10,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422390313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:24:10,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:24:10,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:24:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948120997] [2024-11-12 05:24:10,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:24:10,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:24:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:24:10,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:24:10,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:24:10,604 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 05:24:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:24:10,637 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2024-11-12 05:24:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:24:10,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-12 05:24:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:24:10,648 INFO L225 Difference]: With dead ends: 87 [2024-11-12 05:24:10,649 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 05:24:10,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:24:10,657 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:24:10,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:24:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 05:24:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 05:24:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 05:24:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2024-11-12 05:24:10,703 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 86 [2024-11-12 05:24:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:24:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2024-11-12 05:24:10,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 05:24:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2024-11-12 05:24:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 05:24:10,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:10,707 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:10,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:24:10,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:24:10,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:10,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash -479824553, now seen corresponding path program 1 times [2024-11-12 05:24:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:24:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033532358] [2024-11-12 05:24:10,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:10,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:24:10,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:24:10,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:24:10,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:24:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:11,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 05:24:11,062 INFO L279 TraceCheckSpWp]: Computing forward predicates...