./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-while_file-3.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-while_file-3.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 31756dd7916efb2601436cea2f8a519d26122ead05d2ea63e4128142535cef4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:57:37,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:57:37,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:57:37,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:57:37,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:57:37,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:57:37,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:57:37,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:57:37,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:57:37,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:57:37,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:57:37,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:57:37,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:57:37,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:57:37,179 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:57:37,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:57:37,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:57:37,180 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:57:37,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:57:37,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:57:37,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:57:37,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:57:37,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:57:37,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:57:37,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:57:37,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:57:37,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:57:37,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:57:37,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:57:37,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:57:37,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:57:37,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:57:37,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:57:37,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:57:37,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:57:37,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:57:37,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:57:37,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:57:37,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:57:37,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:57:37,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:57:37,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:57:37,188 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 -> 31756dd7916efb2601436cea2f8a519d26122ead05d2ea63e4128142535cef4c [2024-10-24 09:57:37,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:57:37,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:57:37,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:57:37,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:57:37,430 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:57:37,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-3.i [2024-10-24 09:57:38,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:57:38,886 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:57:38,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-3.i [2024-10-24 09:57:38,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88558d18e/4f3c1f84f27a45589f3f911d9e64955c/FLAG11a32617c [2024-10-24 09:57:38,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88558d18e/4f3c1f84f27a45589f3f911d9e64955c [2024-10-24 09:57:38,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:57:38,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:57:38,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:57:38,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:57:38,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:57:38,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:57:38" (1/1) ... [2024-10-24 09:57:38,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30da3fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:38, skipping insertion in model container [2024-10-24 09:57:38,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:57:38" (1/1) ... [2024-10-24 09:57:38,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:57:39,111 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-while_file-3.i[914,927] [2024-10-24 09:57:39,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:57:39,182 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:57:39,193 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-while_file-3.i[914,927] [2024-10-24 09:57:39,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:57:39,237 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:57:39,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39 WrapperNode [2024-10-24 09:57:39,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:57:39,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:57:39,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:57:39,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:57:39,245 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:57:39" (1/1) ... [2024-10-24 09:57:39,261 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:57:39" (1/1) ... [2024-10-24 09:57:39,305 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-24 09:57:39,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:57:39,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:57:39,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:57:39,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:57:39,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,351 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:57:39,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:57:39,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:57:39,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:57:39,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:57:39,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (1/1) ... [2024-10-24 09:57:39,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:57:39,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:57:39,411 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:57:39,413 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:57:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:57:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:57:39,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:57:39,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:57:39,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:57:39,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:57:39,524 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:57:39,526 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:57:39,824 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 09:57:39,824 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:57:39,855 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:57:39,856 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:57:39,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:57:39 BoogieIcfgContainer [2024-10-24 09:57:39,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:57:39,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:57:39,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:57:39,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:57:39,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:57:38" (1/3) ... [2024-10-24 09:57:39,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70934913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:57:39, skipping insertion in model container [2024-10-24 09:57:39,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:39" (2/3) ... [2024-10-24 09:57:39,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70934913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:57:39, skipping insertion in model container [2024-10-24 09:57:39,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:57:39" (3/3) ... [2024-10-24 09:57:39,863 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-3.i [2024-10-24 09:57:39,877 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:57:39,877 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:57:39,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:57:39,936 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;@686ccc8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:57:39,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:57:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 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:57:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 09:57:39,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:39,952 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] [2024-10-24 09:57:39,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:39,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1325358340, now seen corresponding path program 1 times [2024-10-24 09:57:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:39,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497413493] [2024-10-24 09:57:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:39,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,280 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:57:40,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:40,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497413493] [2024-10-24 09:57:40,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497413493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:40,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:40,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:57:40,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122156809] [2024-10-24 09:57:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:40,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:57:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:40,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:57:40,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:57:40,312 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 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.5) internal successors, (29), 2 states have internal predecessors, (29), 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:57:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:40,349 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-10-24 09:57:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:57:40,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 101 [2024-10-24 09:57:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:40,386 INFO L225 Difference]: With dead ends: 127 [2024-10-24 09:57:40,386 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 09:57:40,390 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:57:40,398 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:40,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:57:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 09:57:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-24 09:57:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 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:57:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 98 transitions. [2024-10-24 09:57:40,478 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 98 transitions. Word has length 101 [2024-10-24 09:57:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:40,479 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 98 transitions. [2024-10-24 09:57:40,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:57:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 98 transitions. [2024-10-24 09:57:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 09:57:40,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:40,484 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] [2024-10-24 09:57:40,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:57:40,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:40,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash -653956102, now seen corresponding path program 1 times [2024-10-24 09:57:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:40,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521195588] [2024-10-24 09:57:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:40,843 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:57:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:40,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521195588] [2024-10-24 09:57:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521195588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:40,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:40,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:57:40,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285663676] [2024-10-24 09:57:40,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:40,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:57:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:40,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:57:40,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:57:40,852 INFO L87 Difference]: Start difference. First operand 63 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:57:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:40,929 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2024-10-24 09:57:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:57:40,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 101 [2024-10-24 09:57:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:40,931 INFO L225 Difference]: With dead ends: 187 [2024-10-24 09:57:40,931 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 09:57:40,932 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:57:40,933 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 60 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:40,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 168 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:57:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 09:57:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-24 09:57:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:57:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-10-24 09:57:40,963 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 101 [2024-10-24 09:57:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:40,964 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-10-24 09:57:40,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:57:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-10-24 09:57:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 09:57:40,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:40,967 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] [2024-10-24 09:57:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:57:40,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:40,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash 381006951, now seen corresponding path program 1 times [2024-10-24 09:57:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91004122] [2024-10-24 09:57:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,113 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:57:41,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91004122] [2024-10-24 09:57:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91004122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:57:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559345177] [2024-10-24 09:57:41,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:41,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:57:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:57:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:57:41,116 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:57:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:41,200 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2024-10-24 09:57:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:57:41,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 102 [2024-10-24 09:57:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:41,204 INFO L225 Difference]: With dead ends: 359 [2024-10-24 09:57:41,204 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 09:57:41,205 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:57:41,206 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 84 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:41,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 244 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:57:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 09:57:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-24 09:57:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 170 states have (on average 1.423529411764706) internal successors, (242), 170 states have internal predecessors, (242), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:57:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 362 transitions. [2024-10-24 09:57:41,243 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 362 transitions. Word has length 102 [2024-10-24 09:57:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:41,244 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 362 transitions. [2024-10-24 09:57:41,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:57:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2024-10-24 09:57:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 09:57:41,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:41,250 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] [2024-10-24 09:57:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:57:41,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash -483673139, now seen corresponding path program 1 times [2024-10-24 09:57:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366002229] [2024-10-24 09:57:41,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:41,381 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:57:41,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:41,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366002229] [2024-10-24 09:57:41,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366002229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:41,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:57:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627957261] [2024-10-24 09:57:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:41,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:57:41,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:41,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:57:41,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:57:41,384 INFO L87 Difference]: Start difference. First operand 235 states and 362 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:57:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:41,432 INFO L93 Difference]: Finished difference Result 579 states and 888 transitions. [2024-10-24 09:57:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:57:41,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 102 [2024-10-24 09:57:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:41,436 INFO L225 Difference]: With dead ends: 579 [2024-10-24 09:57:41,436 INFO L226 Difference]: Without dead ends: 345 [2024-10-24 09:57:41,439 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:57:41,444 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:41,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 206 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:57:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-24 09:57:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 271. [2024-10-24 09:57:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 206 states have internal predecessors, (294), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:57:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 414 transitions. [2024-10-24 09:57:41,481 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 414 transitions. Word has length 102 [2024-10-24 09:57:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:41,482 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 414 transitions. [2024-10-24 09:57:41,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:57:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 414 transitions. [2024-10-24 09:57:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 09:57:41,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:41,487 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] [2024-10-24 09:57:41,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:57:41,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:41,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash 249922612, now seen corresponding path program 1 times [2024-10-24 09:57:41,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966283646] [2024-10-24 09:57:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 09:57:42,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:42,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966283646] [2024-10-24 09:57:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966283646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:42,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:42,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:57:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972541380] [2024-10-24 09:57:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:42,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:57:42,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:57:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:57:42,171 INFO L87 Difference]: Start difference. First operand 271 states and 414 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:57:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:42,763 INFO L93 Difference]: Finished difference Result 827 states and 1218 transitions. [2024-10-24 09:57:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 09:57:42,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-10-24 09:57:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:42,767 INFO L225 Difference]: With dead ends: 827 [2024-10-24 09:57:42,767 INFO L226 Difference]: Without dead ends: 557 [2024-10-24 09:57:42,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-10-24 09:57:42,771 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 213 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:42,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 330 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:57:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-24 09:57:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 481. [2024-10-24 09:57:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 384 states have (on average 1.421875) internal successors, (546), 388 states have internal predecessors, (546), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-24 09:57:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 714 transitions. [2024-10-24 09:57:42,817 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 714 transitions. Word has length 103 [2024-10-24 09:57:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:42,818 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 714 transitions. [2024-10-24 09:57:42,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 09:57:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 714 transitions. [2024-10-24 09:57:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 09:57:42,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:42,820 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] [2024-10-24 09:57:42,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:57:42,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:42,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash -771145742, now seen corresponding path program 1 times [2024-10-24 09:57:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:42,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115590695] [2024-10-24 09:57:42,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:42,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:42,981 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:57:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:42,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115590695] [2024-10-24 09:57:42,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115590695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:42,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:42,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:57:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771591570] [2024-10-24 09:57:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:42,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:57:42,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:42,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:57:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:57:42,984 INFO L87 Difference]: Start difference. First operand 481 states and 714 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (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:57:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:43,073 INFO L93 Difference]: Finished difference Result 1109 states and 1648 transitions. [2024-10-24 09:57:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:57:43,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (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 103 [2024-10-24 09:57:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:43,080 INFO L225 Difference]: With dead ends: 1109 [2024-10-24 09:57:43,080 INFO L226 Difference]: Without dead ends: 629 [2024-10-24 09:57:43,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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:57:43,083 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:43,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 200 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:57:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-24 09:57:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2024-10-24 09:57:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 496 states have (on average 1.4153225806451613) internal successors, (702), 500 states have internal predecessors, (702), 114 states have call successors, (114), 16 states have call predecessors, (114), 16 states have return successors, (114), 110 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-24 09:57:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 930 transitions. [2024-10-24 09:57:43,152 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 930 transitions. Word has length 103 [2024-10-24 09:57:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:43,153 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 930 transitions. [2024-10-24 09:57:43,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (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:57:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 930 transitions. [2024-10-24 09:57:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 09:57:43,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:43,154 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] [2024-10-24 09:57:43,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:57:43,154 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:43,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1098001482, now seen corresponding path program 1 times [2024-10-24 09:57:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506073956] [2024-10-24 09:57:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,335 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:57:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:43,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506073956] [2024-10-24 09:57:43,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506073956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:43,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:57:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733634801] [2024-10-24 09:57:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:43,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:57:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:43,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:57:43,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:57:43,337 INFO L87 Difference]: Start difference. First operand 627 states and 930 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:57:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:43,548 INFO L93 Difference]: Finished difference Result 1577 states and 2347 transitions. [2024-10-24 09:57:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:57:43,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 103 [2024-10-24 09:57:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:43,557 INFO L225 Difference]: With dead ends: 1577 [2024-10-24 09:57:43,558 INFO L226 Difference]: Without dead ends: 1263 [2024-10-24 09:57:43,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:57:43,561 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:43,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 376 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:57:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-24 09:57:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1249. [2024-10-24 09:57:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 988 states have (on average 1.417004048582996) internal successors, (1400), 996 states have internal predecessors, (1400), 228 states have call successors, (228), 32 states have call predecessors, (228), 32 states have return successors, (228), 220 states have call predecessors, (228), 228 states have call successors, (228) [2024-10-24 09:57:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1856 transitions. [2024-10-24 09:57:43,681 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1856 transitions. Word has length 103 [2024-10-24 09:57:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:43,681 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1856 transitions. [2024-10-24 09:57:43,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:57:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1856 transitions. [2024-10-24 09:57:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:57:43,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:43,685 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:57:43,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 09:57:43,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:43,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:43,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1177414852, now seen corresponding path program 1 times [2024-10-24 09:57:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:43,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613183062] [2024-10-24 09:57:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:43,963 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:57:43,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:43,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613183062] [2024-10-24 09:57:43,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613183062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:43,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:43,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:57:43,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000668460] [2024-10-24 09:57:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:43,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:57:43,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:43,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:57:43,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:57:43,966 INFO L87 Difference]: Start difference. First operand 1249 states and 1856 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:57:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:44,412 INFO L93 Difference]: Finished difference Result 2703 states and 4005 transitions. [2024-10-24 09:57:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:57:44,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-10-24 09:57:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:44,419 INFO L225 Difference]: With dead ends: 2703 [2024-10-24 09:57:44,420 INFO L226 Difference]: Without dead ends: 1455 [2024-10-24 09:57:44,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-24 09:57:44,423 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 351 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:44,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 441 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:57:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-10-24 09:57:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1433. [2024-10-24 09:57:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1124 states have (on average 1.4092526690391458) internal successors, (1584), 1134 states have internal predecessors, (1584), 270 states have call successors, (270), 38 states have call predecessors, (270), 38 states have return successors, (270), 260 states have call predecessors, (270), 270 states have call successors, (270) [2024-10-24 09:57:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2124 transitions. [2024-10-24 09:57:44,507 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2124 transitions. Word has length 104 [2024-10-24 09:57:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:44,507 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2124 transitions. [2024-10-24 09:57:44,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:57:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2124 transitions. [2024-10-24 09:57:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:57:44,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:44,509 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:57:44,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 09:57:44,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:44,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash 601749154, now seen corresponding path program 1 times [2024-10-24 09:57:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:44,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556778656] [2024-10-24 09:57:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 09:57:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:45,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556778656] [2024-10-24 09:57:45,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556778656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:57:45,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262116515] [2024-10-24 09:57:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:45,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:57:45,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:57:45,136 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:57:45,137 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:57:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:45,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 09:57:45,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:57:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 310 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-24 09:57:45,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:57:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-24 09:57:46,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262116515] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:57:46,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:57:46,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2024-10-24 09:57:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067478916] [2024-10-24 09:57:46,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:57:46,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-24 09:57:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:46,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-24 09:57:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 09:57:46,810 INFO L87 Difference]: Start difference. First operand 1433 states and 2124 transitions. Second operand has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-24 09:57:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:48,072 INFO L93 Difference]: Finished difference Result 2403 states and 3449 transitions. [2024-10-24 09:57:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 09:57:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) Word has length 104 [2024-10-24 09:57:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:48,078 INFO L225 Difference]: With dead ends: 2403 [2024-10-24 09:57:48,078 INFO L226 Difference]: Without dead ends: 1263 [2024-10-24 09:57:48,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1097, Invalid=2563, Unknown=0, NotChecked=0, Total=3660 [2024-10-24 09:57:48,083 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 945 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:48,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 392 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:57:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-24 09:57:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 513. [2024-10-24 09:57:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 392 states have (on average 1.3341836734693877) internal successors, (523), 392 states have internal predecessors, (523), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-24 09:57:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 703 transitions. [2024-10-24 09:57:48,143 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 703 transitions. Word has length 104 [2024-10-24 09:57:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:48,143 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 703 transitions. [2024-10-24 09:57:48,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8823529411764706) internal successors, (98), 33 states have internal predecessors, (98), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-24 09:57:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 703 transitions. [2024-10-24 09:57:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:57:48,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:48,144 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:57:48,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 09:57:48,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:57:48,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:48,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1001916593, now seen corresponding path program 1 times [2024-10-24 09:57:48,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:48,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192394450] [2024-10-24 09:57:48,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:48,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:57:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:57:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:57:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:57:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:57:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:57:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:57:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:57:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:57:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:57:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:57:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:57:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:57:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:57:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:57:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:57:48,515 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:57:48,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:57:48,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192394450] [2024-10-24 09:57:48,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192394450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:57:48,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:57:48,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:57:48,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515438144] [2024-10-24 09:57:48,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:57:48,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:57:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:57:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:57:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:57:48,517 INFO L87 Difference]: Start difference. First operand 513 states and 703 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:57:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:57:48,750 INFO L93 Difference]: Finished difference Result 1322 states and 1839 transitions. [2024-10-24 09:57:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:57:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:57:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:57:48,754 INFO L225 Difference]: With dead ends: 1322 [2024-10-24 09:57:48,754 INFO L226 Difference]: Without dead ends: 1063 [2024-10-24 09:57:48,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:57:48,756 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 168 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:57:48,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 351 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:57:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-10-24 09:57:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 933. [2024-10-24 09:57:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 732 states have (on average 1.3538251366120218) internal successors, (991), 732 states have internal predecessors, (991), 150 states have call successors, (150), 50 states have call predecessors, (150), 50 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-24 09:57:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1291 transitions. [2024-10-24 09:57:48,881 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1291 transitions. Word has length 104 [2024-10-24 09:57:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:57:48,881 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1291 transitions. [2024-10-24 09:57:48,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:57:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1291 transitions. [2024-10-24 09:57:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 09:57:48,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:57:48,883 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:57:48,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 09:57:48,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:57:48,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:57:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -831236233, now seen corresponding path program 1 times [2024-10-24 09:57:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:57:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981705381] [2024-10-24 09:57:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:57:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:57:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671098041] [2024-10-24 09:57:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:57:48,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:57:48,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:57:48,916 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:57:48,917 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:57:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:57:49,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:57:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:57:49,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:57:49,113 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:57:49,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:57:49,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:57:49,316 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,SelfDestructingSolverStorable10 [2024-10-24 09:57:49,319 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:57:49,385 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:57:49,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:57:49 BoogieIcfgContainer [2024-10-24 09:57:49,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:57:49,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:57:49,390 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:57:49,390 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:57:49,390 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:57:39" (3/4) ... [2024-10-24 09:57:49,392 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:57:49,393 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:57:49,394 INFO L158 Benchmark]: Toolchain (without parser) took 10483.31ms. Allocated memory was 125.8MB in the beginning and 392.2MB in the end (delta: 266.3MB). Free memory was 54.7MB in the beginning and 283.6MB in the end (delta: -228.9MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2024-10-24 09:57:49,394 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:57:49,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.88ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 54.5MB in the beginning and 140.0MB in the end (delta: -85.5MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-24 09:57:49,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.42ms. Allocated memory is still 174.1MB. Free memory was 140.0MB in the beginning and 136.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:57:49,394 INFO L158 Benchmark]: Boogie Preprocessor took 72.25ms. Allocated memory is still 174.1MB. Free memory was 136.9MB in the beginning and 131.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:57:49,395 INFO L158 Benchmark]: RCFGBuilder took 475.67ms. Allocated memory is still 174.1MB. Free memory was 131.6MB in the beginning and 105.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 09:57:49,395 INFO L158 Benchmark]: TraceAbstraction took 9531.02ms. Allocated memory was 174.1MB in the beginning and 392.2MB in the end (delta: 218.1MB). Free memory was 105.4MB in the beginning and 284.7MB in the end (delta: -179.3MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-10-24 09:57:49,395 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 392.2MB. Free memory was 284.7MB in the beginning and 283.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:57:49,397 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.88ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 54.5MB in the beginning and 140.0MB in the end (delta: -85.5MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.42ms. Allocated memory is still 174.1MB. Free memory was 140.0MB in the beginning and 136.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.25ms. Allocated memory is still 174.1MB. Free memory was 136.9MB in the beginning and 131.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 475.67ms. Allocated memory is still 174.1MB. Free memory was 131.6MB in the beginning and 105.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9531.02ms. Allocated memory was 174.1MB in the beginning and 392.2MB in the end (delta: 218.1MB). Free memory was 105.4MB in the beginning and 284.7MB in the end (delta: -179.3MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 392.2MB. Free memory was 284.7MB in the beginning and 283.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L125] RET updateVariables() [L126] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L51] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L57] COND FALSE !(stepLocal_1 || var_1_3) [L62] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L64] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L82] COND FALSE !(var_1_12 == var_1_12) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2002 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1989 mSDsluCounter, 2803 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1770 mSDsCounter, 450 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1385 IncrementalHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 450 mSolverCounterUnsat, 1033 mSDtfsCounter, 1385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 524 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1433occurred in iteration=8, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1072 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1223 ConstructedInterpolants, 0 QuantifiedInterpolants, 5081 SizeOfPredicates, 6 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4959/5040 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:57:49,436 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-while_file-3.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 31756dd7916efb2601436cea2f8a519d26122ead05d2ea63e4128142535cef4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:57:51,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:57:51,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:57:51,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:57:51,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:57:51,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:57:51,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:57:51,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:57:51,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:57:51,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:57:51,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:57:51,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:57:51,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:57:51,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:57:51,484 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:57:51,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:57:51,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:57:51,485 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:57:51,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:57:51,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:57:51,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:57:51,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:57:51,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:57:51,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:57:51,491 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:57:51,491 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:57:51,491 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:57:51,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:57:51,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:57:51,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:57:51,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:57:51,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:57:51,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:57:51,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:57:51,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:57:51,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:57:51,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:57:51,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:57:51,503 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:57:51,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:57:51,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:57:51,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:57:51,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:57:51,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:57:51,504 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:57:51,504 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 -> 31756dd7916efb2601436cea2f8a519d26122ead05d2ea63e4128142535cef4c [2024-10-24 09:57:51,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:57:51,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:57:51,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:57:51,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:57:51,788 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:57:51,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-3.i [2024-10-24 09:57:53,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:57:53,280 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:57:53,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-3.i [2024-10-24 09:57:53,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a7782a9/7377dbf4c139440d9dba75db235471b9/FLAG48431ea99 [2024-10-24 09:57:53,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a7782a9/7377dbf4c139440d9dba75db235471b9 [2024-10-24 09:57:53,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:57:53,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:57:53,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:57:53,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:57:53,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:57:53,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:53,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b47486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53, skipping insertion in model container [2024-10-24 09:57:53,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:53,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:57:53,847 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-while_file-3.i[914,927] [2024-10-24 09:57:53,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:57:53,923 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:57:53,934 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-while_file-3.i[914,927] [2024-10-24 09:57:53,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:57:53,983 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:57:53,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53 WrapperNode [2024-10-24 09:57:53,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:57:53,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:57:53,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:57:53,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:57:53,990 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:57:53" (1/1) ... [2024-10-24 09:57:54,001 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:57:53" (1/1) ... [2024-10-24 09:57:54,033 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-24 09:57:54,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:57:54,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:57:54,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:57:54,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:57:54,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,072 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:57:54,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:57:54,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:57:54,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:57:54,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:57:54,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (1/1) ... [2024-10-24 09:57:54,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:57:54,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:57:54,131 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:57:54,134 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:57:54,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:57:54,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:57:54,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:57:54,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:57:54,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:57:54,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:57:54,251 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:57:54,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:58:10,701 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 09:58:10,701 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:58:10,739 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:58:10,740 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:58:10,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:58:10 BoogieIcfgContainer [2024-10-24 09:58:10,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:58:10,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:58:10,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:58:10,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:58:10,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:57:53" (1/3) ... [2024-10-24 09:58:10,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64efb93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:58:10, skipping insertion in model container [2024-10-24 09:58:10,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:57:53" (2/3) ... [2024-10-24 09:58:10,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64efb93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:58:10, skipping insertion in model container [2024-10-24 09:58:10,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:58:10" (3/3) ... [2024-10-24 09:58:10,749 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-3.i [2024-10-24 09:58:10,764 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:58:10,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:58:10,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:58:10,821 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;@27e969d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:58:10,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:58:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 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:58:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:58:10,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:58:10,834 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] [2024-10-24 09:58:10,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:58:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:58:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash 879549835, now seen corresponding path program 1 times [2024-10-24 09:58:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:58:10,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65480178] [2024-10-24 09:58:10,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:58:10,855 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:58:10,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:58:10,858 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:58:10,859 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:58:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:58:11,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:58:11,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:58:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-24 09:58:11,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:58:11,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:58:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65480178] [2024-10-24 09:58:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65480178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:58:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:58:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:58:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392740646] [2024-10-24 09:58:11,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:58:11,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:58:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:58:11,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:58:11,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:58:11,913 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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:58:16,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:58:16,250 INFO L93 Difference]: Finished difference Result 105 states and 185 transitions. [2024-10-24 09:58:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:58:16,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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 98 [2024-10-24 09:58:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:58:16,371 INFO L225 Difference]: With dead ends: 105 [2024-10-24 09:58:16,371 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 09:58:16,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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:58:16,375 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:58:16,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 09:58:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 09:58:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-24 09:58:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 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:58:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2024-10-24 09:58:16,407 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 98 [2024-10-24 09:58:16,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:58:16,407 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2024-10-24 09:58:16,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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:58:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2024-10-24 09:58:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:58:16,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:58:16,411 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] [2024-10-24 09:58:16,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:58:16,611 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:58:16,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:58:16,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:58:16,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1867586227, now seen corresponding path program 1 times [2024-10-24 09:58:16,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:58:16,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646477660] [2024-10-24 09:58:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:58:16,614 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:58:16,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:58:16,616 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:58:16,618 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:58:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:58:17,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 09:58:17,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:58:20,302 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:58:20,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:58:20,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:58:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646477660] [2024-10-24 09:58:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646477660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:58:20,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:58:20,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:58:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141198770] [2024-10-24 09:58:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:58:20,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:58:20,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:58:20,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:58:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:58:20,306 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:58:24,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:28,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:33,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:35,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:39,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:44,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:47,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:50,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:54,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:58:58,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:59:02,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:59:06,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:59:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:59:06,703 INFO L93 Difference]: Finished difference Result 154 states and 238 transitions. [2024-10-24 09:59:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:59:06,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 98 [2024-10-24 09:59:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:59:06,707 INFO L225 Difference]: With dead ends: 154 [2024-10-24 09:59:06,707 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 09:59:06,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:59:06,708 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 29 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:59:06,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 229 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 46.3s Time] [2024-10-24 09:59:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 09:59:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-24 09:59:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:59:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2024-10-24 09:59:06,722 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 98 [2024-10-24 09:59:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:59:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2024-10-24 09:59:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:59:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2024-10-24 09:59:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 09:59:06,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:59:06,725 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] [2024-10-24 09:59:06,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:59:06,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:59:06,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:59:06,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:59:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1794343179, now seen corresponding path program 1 times [2024-10-24 09:59:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:59:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053125048] [2024-10-24 09:59:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:59:06,927 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:59:06,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:59:06,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:59:06,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:59:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:59:07,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:59:07,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:59:07,987 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:59:07,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:59:07,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:59:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053125048] [2024-10-24 09:59:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053125048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:59:07,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:59:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:59:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038663269] [2024-10-24 09:59:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:59:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:59:07,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:59:07,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:59:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:59:07,989 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:59:12,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:59:16,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []