./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.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 ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:53:59,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:53:59,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:53:59,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:53:59,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:53:59,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:53:59,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:53:59,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:53:59,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:53:59,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:53:59,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:53:59,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:53:59,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:53:59,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:53:59,788 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:53:59,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:53:59,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:53:59,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:53:59,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:53:59,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:53:59,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:53:59,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:53:59,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:53:59,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:53:59,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:53:59,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:53:59,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:53:59,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:53:59,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:53:59,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:53:59,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:53:59,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:53:59,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:53:59,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:53:59,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:53:59,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:53:59,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:53:59,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:53:59,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:53:59,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:53:59,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:53:59,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:53:59,799 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 -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2024-10-24 09:54:00,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:54:00,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:54:00,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:54:00,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:54:00,137 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:54:00,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-10-24 09:54:01,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:54:01,868 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:54:01,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-10-24 09:54:01,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb69e7c32/cda7ac15e1c5499192ebd391237323f1/FLAGe6766c1b6 [2024-10-24 09:54:01,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb69e7c32/cda7ac15e1c5499192ebd391237323f1 [2024-10-24 09:54:01,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:54:01,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:54:01,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:54:01,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:54:01,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:54:01,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:54:01" (1/1) ... [2024-10-24 09:54:01,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1492902f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:01, skipping insertion in model container [2024-10-24 09:54:01,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:54:01" (1/1) ... [2024-10-24 09:54:01,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:54:02,134 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-10-24 09:54:02,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:54:02,228 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:54:02,239 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-10-24 09:54:02,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:54:02,289 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:54:02,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02 WrapperNode [2024-10-24 09:54:02,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:54:02,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:54:02,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:54:02,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:54:02,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,361 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-10-24 09:54:02,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:54:02,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:54:02,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:54:02,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:54:02,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,393 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:54:02,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:54:02,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:54:02,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:54:02,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:54:02,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (1/1) ... [2024-10-24 09:54:02,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:54:02,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:54:02,514 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-10-24 09:54:02,516 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-10-24 09:54:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:54:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:54:02,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:54:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:54:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:54:02,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:54:02,633 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:54:02,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:54:03,002 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-24 09:54:03,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:54:03,055 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:54:03,055 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:54:03,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:54:03 BoogieIcfgContainer [2024-10-24 09:54:03,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:54:03,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:54:03,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:54:03,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:54:03,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:54:01" (1/3) ... [2024-10-24 09:54:03,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450929a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:54:03, skipping insertion in model container [2024-10-24 09:54:03,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:02" (2/3) ... [2024-10-24 09:54:03,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450929a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:54:03, skipping insertion in model container [2024-10-24 09:54:03,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:54:03" (3/3) ... [2024-10-24 09:54:03,067 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-10-24 09:54:03,081 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:54:03,081 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:54:03,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:54:03,149 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;@23f56d6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:54:03,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:54:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:54:03,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:03,165 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:03,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:03,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1660970956, now seen corresponding path program 1 times [2024-10-24 09:54:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851463446] [2024-10-24 09:54:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:03,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851463446] [2024-10-24 09:54:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851463446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:54:03,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742094168] [2024-10-24 09:54:03,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:03,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:54:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:03,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:54:03,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:54:03,571 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:54:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:03,625 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2024-10-24 09:54:03,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:54:03,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-10-24 09:54:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:03,639 INFO L225 Difference]: With dead ends: 135 [2024-10-24 09:54:03,639 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 09:54:03,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:54:03,645 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:03,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:54:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 09:54:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 09:54:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-10-24 09:54:03,692 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 104 [2024-10-24 09:54:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:03,693 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-24 09:54:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:54:03,694 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-10-24 09:54:03,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:54:03,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:03,697 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:03,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:54:03,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:03,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:03,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1211946298, now seen corresponding path program 1 times [2024-10-24 09:54:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056523648] [2024-10-24 09:54:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:04,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:04,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:04,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056523648] [2024-10-24 09:54:04,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056523648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:54:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027205189] [2024-10-24 09:54:04,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:04,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:54:04,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:04,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:54:04,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:54:04,031 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:04,067 INFO L93 Difference]: Finished difference Result 132 states and 197 transitions. [2024-10-24 09:54:04,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:54:04,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-24 09:54:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:04,070 INFO L225 Difference]: With dead ends: 132 [2024-10-24 09:54:04,070 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 09:54:04,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:54:04,074 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:04,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:54:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 09:54:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 09:54:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-10-24 09:54:04,095 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 104 [2024-10-24 09:54:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:04,097 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-10-24 09:54:04,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-10-24 09:54:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 09:54:04,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:04,100 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:04,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:54:04,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:04,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:04,101 INFO L85 PathProgramCache]: Analyzing trace with hash 24101822, now seen corresponding path program 1 times [2024-10-24 09:54:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:04,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414729541] [2024-10-24 09:54:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414729541] [2024-10-24 09:54:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414729541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:06,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:54:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588600605] [2024-10-24 09:54:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:06,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:54:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:06,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:54:06,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:54:06,222 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:06,704 INFO L93 Difference]: Finished difference Result 172 states and 253 transitions. [2024-10-24 09:54:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:54:06,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-10-24 09:54:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:06,707 INFO L225 Difference]: With dead ends: 172 [2024-10-24 09:54:06,707 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 09:54:06,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:54:06,711 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 131 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:06,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 291 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:54:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 09:54:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2024-10-24 09:54:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2024-10-24 09:54:06,731 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 105 [2024-10-24 09:54:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:06,731 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2024-10-24 09:54:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2024-10-24 09:54:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 09:54:06,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:06,735 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:06,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:54:06,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:06,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1970042884, now seen corresponding path program 1 times [2024-10-24 09:54:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70190139] [2024-10-24 09:54:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70190139] [2024-10-24 09:54:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70190139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:08,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:54:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595769083] [2024-10-24 09:54:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:08,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:54:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:54:08,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:54:08,893 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:09,830 INFO L93 Difference]: Finished difference Result 259 states and 383 transitions. [2024-10-24 09:54:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:54:09,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-10-24 09:54:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:09,833 INFO L225 Difference]: With dead ends: 259 [2024-10-24 09:54:09,833 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 09:54:09,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:54:09,835 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 131 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:09,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 395 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 09:54:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 09:54:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 93. [2024-10-24 09:54:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-10-24 09:54:09,844 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 105 [2024-10-24 09:54:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:09,844 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-10-24 09:54:09,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-10-24 09:54:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 09:54:09,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:09,846 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:09,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:54:09,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:09,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1507275962, now seen corresponding path program 1 times [2024-10-24 09:54:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:09,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028927862] [2024-10-24 09:54:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:10,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028927862] [2024-10-24 09:54:10,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028927862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:10,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:10,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:54:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486080652] [2024-10-24 09:54:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:10,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:54:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:54:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:54:10,710 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:11,136 INFO L93 Difference]: Finished difference Result 226 states and 335 transitions. [2024-10-24 09:54:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:54:11,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-10-24 09:54:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:11,140 INFO L225 Difference]: With dead ends: 226 [2024-10-24 09:54:11,140 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 09:54:11,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:54:11,142 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 92 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:11,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 425 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:54:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 09:54:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 69. [2024-10-24 09:54:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2024-10-24 09:54:11,156 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 105 [2024-10-24 09:54:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:11,157 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2024-10-24 09:54:11,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2024-10-24 09:54:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:54:11,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:11,158 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:11,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:54:11,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1330330211, now seen corresponding path program 1 times [2024-10-24 09:54:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700238167] [2024-10-24 09:54:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 09:54:11,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:11,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700238167] [2024-10-24 09:54:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700238167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:54:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113711892] [2024-10-24 09:54:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:11,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:54:11,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:54:11,366 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-10-24 09:54:11,368 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-10-24 09:54:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:11,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 09:54:11,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:54:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 09:54:11,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:54:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 09:54:11,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113711892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:54:11,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:54:11,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-24 09:54:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883527271] [2024-10-24 09:54:11,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:54:11,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 09:54:11,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:12,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 09:54:12,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:54:12,001 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-24 09:54:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:12,179 INFO L93 Difference]: Finished difference Result 147 states and 209 transitions. [2024-10-24 09:54:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 09:54:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 107 [2024-10-24 09:54:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:12,181 INFO L225 Difference]: With dead ends: 147 [2024-10-24 09:54:12,181 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 09:54:12,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-10-24 09:54:12,183 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 197 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:12,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 151 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:54:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 09:54:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-24 09:54:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2024-10-24 09:54:12,191 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 107 [2024-10-24 09:54:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:12,191 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2024-10-24 09:54:12,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-24 09:54:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2024-10-24 09:54:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:54:12,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:12,193 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:12,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:54:12,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 09:54:12,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:12,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash -258017691, now seen corresponding path program 1 times [2024-10-24 09:54:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:12,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261128215] [2024-10-24 09:54:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:54:12,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735788635] [2024-10-24 09:54:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:12,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:54:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:54:12,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:54:12,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:54:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:12,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 09:54:12,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:54:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-24 09:54:13,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:54:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 09:54:13,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:13,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261128215] [2024-10-24 09:54:13,408 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 09:54:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735788635] [2024-10-24 09:54:13,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735788635] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:54:13,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:54:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-24 09:54:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720159271] [2024-10-24 09:54:13,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:54:13,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 09:54:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 09:54:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-24 09:54:13,411 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-24 09:54:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:14,209 INFO L93 Difference]: Finished difference Result 241 states and 320 transitions. [2024-10-24 09:54:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 09:54:14,210 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 107 [2024-10-24 09:54:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:14,212 INFO L225 Difference]: With dead ends: 241 [2024-10-24 09:54:14,213 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 09:54:14,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-10-24 09:54:14,215 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 256 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:14,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 609 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 09:54:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 09:54:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 116. [2024-10-24 09:54:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2024-10-24 09:54:14,234 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 107 [2024-10-24 09:54:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2024-10-24 09:54:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-24 09:54:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2024-10-24 09:54:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:54:14,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:14,238 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:14,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:54:14,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 09:54:14,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1806289774, now seen corresponding path program 1 times [2024-10-24 09:54:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503262554] [2024-10-24 09:54:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:14,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:14,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:14,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503262554] [2024-10-24 09:54:14,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503262554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:14,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:54:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970472926] [2024-10-24 09:54:14,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:14,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:54:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:14,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:54:14,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:54:14,538 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:14,660 INFO L93 Difference]: Finished difference Result 280 states and 377 transitions. [2024-10-24 09:54:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:54:14,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-10-24 09:54:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:14,662 INFO L225 Difference]: With dead ends: 280 [2024-10-24 09:54:14,662 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 09:54:14,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:54:14,664 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:14,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 183 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:54:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 09:54:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 116. [2024-10-24 09:54:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2024-10-24 09:54:14,682 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 107 [2024-10-24 09:54:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:14,686 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2024-10-24 09:54:14,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2024-10-24 09:54:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:54:14,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:14,687 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:14,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 09:54:14,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:14,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1954571470, now seen corresponding path program 1 times [2024-10-24 09:54:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:14,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489370610] [2024-10-24 09:54:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:14,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489370610] [2024-10-24 09:54:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489370610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:15,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:15,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:54:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406581445] [2024-10-24 09:54:15,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:15,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:54:15,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:15,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:54:15,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:54:15,723 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:16,316 INFO L93 Difference]: Finished difference Result 467 states and 619 transitions. [2024-10-24 09:54:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:54:16,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-10-24 09:54:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:16,319 INFO L225 Difference]: With dead ends: 467 [2024-10-24 09:54:16,319 INFO L226 Difference]: Without dead ends: 352 [2024-10-24 09:54:16,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:54:16,320 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 194 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:16,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 632 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 09:54:16,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-24 09:54:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 233. [2024-10-24 09:54:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 199 states have internal predecessors, (264), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 09:54:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 316 transitions. [2024-10-24 09:54:16,339 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 316 transitions. Word has length 107 [2024-10-24 09:54:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:16,339 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 316 transitions. [2024-10-24 09:54:16,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2024-10-24 09:54:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:54:16,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:16,342 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:16,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 09:54:16,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:16,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1136923020, now seen corresponding path program 1 times [2024-10-24 09:54:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976695195] [2024-10-24 09:54:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-24 09:54:16,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:16,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976695195] [2024-10-24 09:54:16,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976695195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:54:16,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508314666] [2024-10-24 09:54:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:16,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:54:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:54:16,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:54:16,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 09:54:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:16,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 09:54:16,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:54:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:16,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:54:16,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508314666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:16,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:54:16,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-24 09:54:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640953109] [2024-10-24 09:54:16,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:16,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:54:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:54:16,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-10-24 09:54:16,934 INFO L87 Difference]: Start difference. First operand 233 states and 316 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:17,126 INFO L93 Difference]: Finished difference Result 561 states and 752 transitions. [2024-10-24 09:54:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:54:17,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-10-24 09:54:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:17,130 INFO L225 Difference]: With dead ends: 561 [2024-10-24 09:54:17,130 INFO L226 Difference]: Without dead ends: 329 [2024-10-24 09:54:17,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:54:17,132 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:17,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 353 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:54:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-24 09:54:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 239. [2024-10-24 09:54:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.3333333333333333) internal successors, (272), 205 states have internal predecessors, (272), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 09:54:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 324 transitions. [2024-10-24 09:54:17,149 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 324 transitions. Word has length 107 [2024-10-24 09:54:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:17,150 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 324 transitions. [2024-10-24 09:54:17,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 324 transitions. [2024-10-24 09:54:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 09:54:17,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:17,151 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:17,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 09:54:17,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:54:17,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:17,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:17,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1765748874, now seen corresponding path program 1 times [2024-10-24 09:54:17,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:17,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402614250] [2024-10-24 09:54:17,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:17,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:19,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:19,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402614250] [2024-10-24 09:54:19,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402614250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:19,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:19,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 09:54:19,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122423325] [2024-10-24 09:54:19,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:19,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 09:54:19,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 09:54:19,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 09:54:19,143 INFO L87 Difference]: Start difference. First operand 239 states and 324 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:20,599 INFO L93 Difference]: Finished difference Result 667 states and 895 transitions. [2024-10-24 09:54:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 09:54:20,601 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-10-24 09:54:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:20,603 INFO L225 Difference]: With dead ends: 667 [2024-10-24 09:54:20,603 INFO L226 Difference]: Without dead ends: 429 [2024-10-24 09:54:20,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:54:20,607 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 248 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:20,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 554 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 09:54:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-24 09:54:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 299. [2024-10-24 09:54:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 264 states have (on average 1.3257575757575757) internal successors, (350), 265 states have internal predecessors, (350), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 09:54:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 402 transitions. [2024-10-24 09:54:20,641 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 402 transitions. Word has length 108 [2024-10-24 09:54:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:20,641 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 402 transitions. [2024-10-24 09:54:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 402 transitions. [2024-10-24 09:54:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 09:54:20,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:20,643 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:20,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 09:54:20,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:20,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1799463886, now seen corresponding path program 1 times [2024-10-24 09:54:20,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:20,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147426407] [2024-10-24 09:54:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:54:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:54:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:54:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:54:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:54:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:54:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:54:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:54:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:54:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:54:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:54:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:54:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:54:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:54:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:54:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:54:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:54:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147426407] [2024-10-24 09:54:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147426407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:20,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:20,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:54:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174499440] [2024-10-24 09:54:20,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:20,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:54:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:54:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:54:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:54:20,711 INFO L87 Difference]: Start difference. First operand 299 states and 402 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:20,782 INFO L93 Difference]: Finished difference Result 667 states and 898 transitions. [2024-10-24 09:54:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:54:20,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-10-24 09:54:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:20,785 INFO L225 Difference]: With dead ends: 667 [2024-10-24 09:54:20,785 INFO L226 Difference]: Without dead ends: 369 [2024-10-24 09:54:20,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:54:20,786 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:20,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:54:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-24 09:54:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 309. [2024-10-24 09:54:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 274 states have (on average 1.313868613138686) internal successors, (360), 275 states have internal predecessors, (360), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 09:54:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 412 transitions. [2024-10-24 09:54:20,810 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 412 transitions. Word has length 108 [2024-10-24 09:54:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:20,810 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 412 transitions. [2024-10-24 09:54:20,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:54:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 412 transitions. [2024-10-24 09:54:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 09:54:20,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:20,812 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:20,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 09:54:20,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:20,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash 213763933, now seen corresponding path program 1 times [2024-10-24 09:54:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:54:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998672410] [2024-10-24 09:54:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:54:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:54:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127999851] [2024-10-24 09:54:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:20,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:54:20,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:54:20,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:54:20,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 09:54:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:54:21,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:54:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:54:21,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:54:21,426 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:54:21,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:54:21,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 09:54:21,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:54:21,635 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:21,742 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:54:21,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:54:21 BoogieIcfgContainer [2024-10-24 09:54:21,745 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:54:21,745 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:54:21,745 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:54:21,746 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:54:21,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:54:03" (3/4) ... [2024-10-24 09:54:21,749 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:54:21,750 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:54:21,751 INFO L158 Benchmark]: Toolchain (without parser) took 19844.98ms. Allocated memory was 140.5MB in the beginning and 388.0MB in the end (delta: 247.5MB). Free memory was 87.6MB in the beginning and 341.8MB in the end (delta: -254.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:54:21,751 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:54:21,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.53ms. Allocated memory is still 140.5MB. Free memory was 87.3MB in the beginning and 72.3MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 09:54:21,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.05ms. Allocated memory is still 140.5MB. Free memory was 72.3MB in the beginning and 69.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:54:21,751 INFO L158 Benchmark]: Boogie Preprocessor took 76.14ms. Allocated memory is still 140.5MB. Free memory was 69.3MB in the beginning and 112.1MB in the end (delta: -42.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-10-24 09:54:21,752 INFO L158 Benchmark]: RCFGBuilder took 616.04ms. Allocated memory is still 140.5MB. Free memory was 112.1MB in the beginning and 87.2MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 09:54:21,752 INFO L158 Benchmark]: TraceAbstraction took 18688.00ms. Allocated memory was 140.5MB in the beginning and 388.0MB in the end (delta: 247.5MB). Free memory was 86.5MB in the beginning and 341.8MB in the end (delta: -255.3MB). Peak memory consumption was 210.6MB. Max. memory is 16.1GB. [2024-10-24 09:54:21,753 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 388.0MB. Free memory is still 341.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:54:21,754 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.53ms. Allocated memory is still 140.5MB. Free memory was 87.3MB in the beginning and 72.3MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.05ms. Allocated memory is still 140.5MB. Free memory was 72.3MB in the beginning and 69.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.14ms. Allocated memory is still 140.5MB. Free memory was 69.3MB in the beginning and 112.1MB in the end (delta: -42.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * RCFGBuilder took 616.04ms. Allocated memory is still 140.5MB. Free memory was 112.1MB in the beginning and 87.2MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18688.00ms. Allocated memory was 140.5MB in the beginning and 388.0MB in the end (delta: 247.5MB). Free memory was 86.5MB in the beginning and 341.8MB in the end (delta: -255.3MB). Peak memory consumption was 210.6MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 388.0MB. Free memory is still 341.8MB. 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 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] int k_loop; [L126] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] COND TRUE k_loop < 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L129] RET step() [L130] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=65538, var_1_6=8, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1388 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1382 mSDsluCounter, 4023 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2858 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3270 IncrementalHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 1165 mSDtfsCounter, 3270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 980 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=12, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 655 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1686 ConstructedInterpolants, 0 QuantifiedInterpolants, 6787 SizeOfPredicates, 10 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 6492/6720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:54:21,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.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 ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:54:24,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:54:24,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:54:24,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:54:24,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:54:24,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:54:24,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:54:24,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:54:24,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:54:24,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:54:24,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:54:24,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:54:24,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:54:24,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:54:24,143 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:54:24,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:54:24,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:54:24,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:54:24,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:54:24,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:54:24,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:54:24,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:54:24,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:54:24,150 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:54:24,151 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:54:24,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:54:24,151 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:54:24,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:54:24,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:54:24,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:54:24,152 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:54:24,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:54:24,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:54:24,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:54:24,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:54:24,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:54:24,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:54:24,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:54:24,156 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:54:24,156 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:54:24,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:54:24,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:54:24,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:54:24,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:54:24,158 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:54:24,158 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 -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2024-10-24 09:54:24,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:54:24,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:54:24,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:54:24,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:54:24,506 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:54:24,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-10-24 09:54:26,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:54:26,287 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:54:26,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-10-24 09:54:26,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a98056bb/45f4ce65c61147e7999b306bc4475d7d/FLAG78436feb9 [2024-10-24 09:54:26,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a98056bb/45f4ce65c61147e7999b306bc4475d7d [2024-10-24 09:54:26,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:54:26,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:54:26,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:54:26,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:54:26,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:54:26,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@107cf29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26, skipping insertion in model container [2024-10-24 09:54:26,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:54:26,549 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-10-24 09:54:26,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:54:26,663 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:54:26,677 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-10-24 09:54:26,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:54:26,738 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:54:26,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26 WrapperNode [2024-10-24 09:54:26,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:54:26,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:54:26,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:54:26,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:54:26,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,796 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-10-24 09:54:26,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:54:26,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:54:26,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:54:26,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:54:26,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,831 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:54:26,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:54:26,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:54:26,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:54:26,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:54:26,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (1/1) ... [2024-10-24 09:54:26,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:54:26,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:54:26,891 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-10-24 09:54:26,897 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-10-24 09:54:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:54:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:54:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:54:26,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:54:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:54:26,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:54:27,008 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:54:27,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:54:27,474 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-24 09:54:27,474 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:54:27,533 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:54:27,533 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:54:27,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:54:27 BoogieIcfgContainer [2024-10-24 09:54:27,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:54:27,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:54:27,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:54:27,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:54:27,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:54:26" (1/3) ... [2024-10-24 09:54:27,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df02a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:54:27, skipping insertion in model container [2024-10-24 09:54:27,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:54:26" (2/3) ... [2024-10-24 09:54:27,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df02a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:54:27, skipping insertion in model container [2024-10-24 09:54:27,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:54:27" (3/3) ... [2024-10-24 09:54:27,544 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-10-24 09:54:27,559 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:54:27,560 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:54:27,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:54:27,635 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;@7d7d89b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:54:27,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:54:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 09:54:27,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:27,651 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:27,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:27,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:27,658 INFO L85 PathProgramCache]: Analyzing trace with hash -41516697, now seen corresponding path program 1 times [2024-10-24 09:54:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:54:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888199597] [2024-10-24 09:54:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:27,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:54:27,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:54:27,677 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-10-24 09:54:27,678 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-10-24 09:54:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:27,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:54:27,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:54:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 09:54:27,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:54:27,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:54:27,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888199597] [2024-10-24 09:54:27,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888199597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:54:27,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:54:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:54:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912812531] [2024-10-24 09:54:27,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:54:27,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:54:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:54:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:54:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:54:27,967 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:54:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:54:28,071 INFO L93 Difference]: Finished difference Result 97 states and 166 transitions. [2024-10-24 09:54:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:54:28,074 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-10-24 09:54:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:54:28,082 INFO L225 Difference]: With dead ends: 97 [2024-10-24 09:54:28,083 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 09:54:28,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:54:28,090 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:54:28,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:54:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 09:54:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 09:54:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 09:54:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2024-10-24 09:54:28,145 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 96 [2024-10-24 09:54:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:54:28,146 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2024-10-24 09:54:28,147 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:54:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2024-10-24 09:54:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 09:54:28,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:54:28,150 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:54:28,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 09:54:28,350 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-10-24 09:54:28,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:54:28,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:54:28,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1880474684, now seen corresponding path program 1 times [2024-10-24 09:54:28,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:54:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183386591] [2024-10-24 09:54:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:54:28,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:54:28,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:54:28,357 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-10-24 09:54:28,358 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-10-24 09:54:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:54:28,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 09:54:28,568 INFO L278 TraceCheckSpWp]: Computing forward predicates...