./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-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-84.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 e5e6f5c277a9443bc03588ce855c247558c509f1528d6c079343ba850cfa2ecb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:12:48,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:12:48,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:12:48,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:12:48,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:12:48,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:12:48,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:12:48,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:12:48,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:12:48,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:12:48,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:12:48,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:12:48,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:12:48,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:12:48,829 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:12:48,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:12:48,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:12:48,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:12:48,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:12:48,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:12:48,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:12:48,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:12:48,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:12:48,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:12:48,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:12:48,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:12:48,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:12:48,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:12:48,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:12:48,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:12:48,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:12:48,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:12:48,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:12:48,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:12:48,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:12:48,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:12:48,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:12:48,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:12:48,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:12:48,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:12:48,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:12:48,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:12:48,840 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 -> e5e6f5c277a9443bc03588ce855c247558c509f1528d6c079343ba850cfa2ecb [2024-10-14 12:12:49,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:12:49,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:12:49,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:12:49,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:12:49,159 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:12:49,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-84.i [2024-10-14 12:12:50,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:12:50,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:12:50,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-84.i [2024-10-14 12:12:50,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9712a4b6b/0a39a7dcbd33422b8f4deca7cb2454a5/FLAG15382a956 [2024-10-14 12:12:50,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9712a4b6b/0a39a7dcbd33422b8f4deca7cb2454a5 [2024-10-14 12:12:50,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:12:50,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:12:50,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:12:50,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:12:50,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:12:50,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:12:50" (1/1) ... [2024-10-14 12:12:50,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45121737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:50, skipping insertion in model container [2024-10-14 12:12:50,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:12:50" (1/1) ... [2024-10-14 12:12:50,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:12:51,089 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-84.i[915,928] [2024-10-14 12:12:51,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:12:51,167 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:12:51,182 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-84.i[915,928] [2024-10-14 12:12:51,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:12:51,269 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:12:51,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51 WrapperNode [2024-10-14 12:12:51,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:12:51,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:12:51,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:12:51,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:12:51,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,340 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-14 12:12:51,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:12:51,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:12:51,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:12:51,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:12:51,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,397 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-14 12:12:51,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:12:51,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:12:51,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:12:51,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:12:51,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (1/1) ... [2024-10-14 12:12:51,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:12:51,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:12:51,474 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-14 12:12:51,481 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-14 12:12:51,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:12:51,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:12:51,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:12:51,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:12:51,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:12:51,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:12:51,623 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:12:51,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:12:52,143 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-14 12:12:52,143 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:12:52,181 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:12:52,182 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:12:52,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:52 BoogieIcfgContainer [2024-10-14 12:12:52,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:12:52,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:12:52,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:12:52,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:12:52,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:12:50" (1/3) ... [2024-10-14 12:12:52,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d181107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:12:52, skipping insertion in model container [2024-10-14 12:12:52,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:12:51" (2/3) ... [2024-10-14 12:12:52,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d181107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:12:52, skipping insertion in model container [2024-10-14 12:12:52,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:52" (3/3) ... [2024-10-14 12:12:52,192 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-84.i [2024-10-14 12:12:52,215 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:12:52,215 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:12:52,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:12:52,314 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;@79306fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:12:52,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:12:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:12:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 12:12:52,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:12:52,338 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:12:52,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:12:52,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:12:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash 313342948, now seen corresponding path program 1 times [2024-10-14 12:12:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:12:52,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487623130] [2024-10-14 12:12:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:12:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:12:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:12:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:12:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:12:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:12:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:12:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:12:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:12:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:12:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:12:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:12:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:12:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:12:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:12:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:12:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:12:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:12:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:12:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:12:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:12:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:12:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:12:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:12:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:12:52,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:12:52,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487623130] [2024-10-14 12:12:52,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487623130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:12:52,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:12:52,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:12:52,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150007395] [2024-10-14 12:12:52,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:12:52,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:12:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:12:52,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:12:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:12:52,847 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 12:12:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:12:52,889 INFO L93 Difference]: Finished difference Result 147 states and 254 transitions. [2024-10-14 12:12:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:12:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-10-14 12:12:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:12:52,903 INFO L225 Difference]: With dead ends: 147 [2024-10-14 12:12:52,903 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 12:12:52,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-14 12:12:52,912 INFO L432 NwaCegarLoop]: 109 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, 109 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-14 12:12:52,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:12:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 12:12:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-14 12:12:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:12:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-10-14 12:12:52,963 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 141 [2024-10-14 12:12:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:12:52,965 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-10-14 12:12:52,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 12:12:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-10-14 12:12:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 12:12:52,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:12:52,971 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:12:52,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:12:52,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:12:52,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:12:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1808792156, now seen corresponding path program 1 times [2024-10-14 12:12:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:12:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014169256] [2024-10-14 12:12:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:12:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:12:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:12:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:12:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:12:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:12:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:12:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:12:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:12:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:12:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:12:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:12:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:12:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:12:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:12:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:12:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:12:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:12:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:12:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:12:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:12:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:12:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:12:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:12:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:12:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:12:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014169256] [2024-10-14 12:12:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014169256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:12:53,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:12:53,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:12:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669785411] [2024-10-14 12:12:53,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:12:53,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:12:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:12:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:12:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:12:53,621 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:12:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:12:53,665 INFO L93 Difference]: Finished difference Result 145 states and 223 transitions. [2024-10-14 12:12:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:12:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-14 12:12:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:12:53,670 INFO L225 Difference]: With dead ends: 145 [2024-10-14 12:12:53,671 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 12:12:53,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-14 12:12:53,674 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:12:53,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:12:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 12:12:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-14 12:12:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:12:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-10-14 12:12:53,695 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 141 [2024-10-14 12:12:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:12:53,701 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-10-14 12:12:53,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:12:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-10-14 12:12:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 12:12:53,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:12:53,703 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:12:53,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:12:53,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:12:53,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:12:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1107727578, now seen corresponding path program 1 times [2024-10-14 12:12:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:12:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17047770] [2024-10-14 12:12:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:12:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:12:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:12:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:12:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:12:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:12:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:12:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:12:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:12:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:12:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:12:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:12:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:12:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:12:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:12:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:12:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:12:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:12:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:12:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:12:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:12:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:12:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:12:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:12:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:12:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:12:56,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:12:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17047770] [2024-10-14 12:12:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17047770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:12:56,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:12:56,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:12:56,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211212267] [2024-10-14 12:12:56,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:12:56,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:12:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:12:56,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:12:56,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:12:56,883 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:12:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:12:58,139 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2024-10-14 12:12:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:12:58,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-14 12:12:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:12:58,144 INFO L225 Difference]: With dead ends: 178 [2024-10-14 12:12:58,144 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 12:12:58,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:12:58,150 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 37 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 12:12:58,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 417 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 12:12:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 12:12:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-14 12:12:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 75 states have internal predecessors, (100), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 12:12:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-14 12:12:58,175 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 141 [2024-10-14 12:12:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:12:58,176 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-14 12:12:58,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:12:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-14 12:12:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 12:12:58,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:12:58,179 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:12:58,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:12:58,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:12:58,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:12:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 141776580, now seen corresponding path program 1 times [2024-10-14 12:12:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:12:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946632604] [2024-10-14 12:12:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:12:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:12:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946632604] [2024-10-14 12:13:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946632604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:01,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:13:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065464710] [2024-10-14 12:13:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:13:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:13:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:13:01,452 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:02,031 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2024-10-14 12:13:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:13:02,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-14 12:13:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:02,035 INFO L225 Difference]: With dead ends: 243 [2024-10-14 12:13:02,035 INFO L226 Difference]: Without dead ends: 141 [2024-10-14 12:13:02,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:13:02,037 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 97 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:02,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 382 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:13:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-14 12:13:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-10-14 12:13:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 105 states have internal predecessors, (136), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 12:13:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 196 transitions. [2024-10-14 12:13:02,063 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 196 transitions. Word has length 142 [2024-10-14 12:13:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:02,064 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 196 transitions. [2024-10-14 12:13:02,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2024-10-14 12:13:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 12:13:02,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:02,068 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:02,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:13:02,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:02,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -445029434, now seen corresponding path program 1 times [2024-10-14 12:13:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963542008] [2024-10-14 12:13:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963542008] [2024-10-14 12:13:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963542008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:02,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:02,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:13:02,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599517824] [2024-10-14 12:13:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:02,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:13:02,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:02,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:13:02,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:13:02,710 INFO L87 Difference]: Start difference. First operand 137 states and 196 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:03,062 INFO L93 Difference]: Finished difference Result 274 states and 389 transitions. [2024-10-14 12:13:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:13:03,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-14 12:13:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:03,066 INFO L225 Difference]: With dead ends: 274 [2024-10-14 12:13:03,067 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 12:13:03,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:13:03,068 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 40 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:03,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 462 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:13:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 12:13:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2024-10-14 12:13:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.308641975308642) internal successors, (106), 83 states have internal predecessors, (106), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 12:13:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-10-14 12:13:03,116 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 142 [2024-10-14 12:13:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:03,116 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-10-14 12:13:03,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-10-14 12:13:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 12:13:03,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:03,121 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:03,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:13:03,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:03,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash -6372629, now seen corresponding path program 1 times [2024-10-14 12:13:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913508528] [2024-10-14 12:13:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:06,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913508528] [2024-10-14 12:13:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913508528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:06,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:06,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 12:13:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617093192] [2024-10-14 12:13:06,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:06,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 12:13:06,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:06,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 12:13:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:13:06,298 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:07,437 INFO L93 Difference]: Finished difference Result 351 states and 493 transitions. [2024-10-14 12:13:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 12:13:07,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-14 12:13:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:07,441 INFO L225 Difference]: With dead ends: 351 [2024-10-14 12:13:07,441 INFO L226 Difference]: Without dead ends: 245 [2024-10-14 12:13:07,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-14 12:13:07,445 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 186 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:07,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 587 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 12:13:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-14 12:13:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 145. [2024-10-14 12:13:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 12:13:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-14 12:13:07,483 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-14 12:13:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:07,485 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-14 12:13:07,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-14 12:13:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 12:13:07,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:07,490 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:07,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 12:13:07,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:07,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash -399399639, now seen corresponding path program 1 times [2024-10-14 12:13:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395541943] [2024-10-14 12:13:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395541943] [2024-10-14 12:13:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395541943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 12:13:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484634575] [2024-10-14 12:13:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 12:13:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 12:13:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-14 12:13:10,013 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:11,496 INFO L93 Difference]: Finished difference Result 360 states and 505 transitions. [2024-10-14 12:13:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 12:13:11,498 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-14 12:13:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:11,499 INFO L225 Difference]: With dead ends: 360 [2024-10-14 12:13:11,500 INFO L226 Difference]: Without dead ends: 223 [2024-10-14 12:13:11,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-10-14 12:13:11,501 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 286 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:11,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 302 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 12:13:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-14 12:13:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 145. [2024-10-14 12:13:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 12:13:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-14 12:13:11,527 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-14 12:13:11,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:11,528 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-14 12:13:11,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-14 12:13:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 12:13:11,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:11,530 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:11,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 12:13:11,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:11,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 251792809, now seen corresponding path program 1 times [2024-10-14 12:13:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309997352] [2024-10-14 12:13:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309997352] [2024-10-14 12:13:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309997352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:13,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 12:13:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271710021] [2024-10-14 12:13:13,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:13,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 12:13:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:13,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 12:13:13,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:13:13,214 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:14,070 INFO L93 Difference]: Finished difference Result 388 states and 542 transitions. [2024-10-14 12:13:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:13:14,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-14 12:13:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:14,075 INFO L225 Difference]: With dead ends: 388 [2024-10-14 12:13:14,078 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 12:13:14,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-14 12:13:14,079 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 94 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:14,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 525 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 12:13:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 12:13:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 149. [2024-10-14 12:13:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 118 states have internal predecessors, (155), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 12:13:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 211 transitions. [2024-10-14 12:13:14,107 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 211 transitions. Word has length 143 [2024-10-14 12:13:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:14,108 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 211 transitions. [2024-10-14 12:13:14,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2024-10-14 12:13:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 12:13:14,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:14,109 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:14,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 12:13:14,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:14,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -141234201, now seen corresponding path program 1 times [2024-10-14 12:13:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:14,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155566825] [2024-10-14 12:13:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:16,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:16,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155566825] [2024-10-14 12:13:16,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155566825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:16,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 12:13:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982840219] [2024-10-14 12:13:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:16,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 12:13:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:16,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 12:13:16,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:13:16,043 INFO L87 Difference]: Start difference. First operand 149 states and 211 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:17,130 INFO L93 Difference]: Finished difference Result 358 states and 503 transitions. [2024-10-14 12:13:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 12:13:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-14 12:13:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:17,133 INFO L225 Difference]: With dead ends: 358 [2024-10-14 12:13:17,133 INFO L226 Difference]: Without dead ends: 217 [2024-10-14 12:13:17,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-14 12:13:17,136 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 94 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:17,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 575 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 12:13:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-14 12:13:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 145. [2024-10-14 12:13:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 12:13:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-14 12:13:17,163 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-14 12:13:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:17,163 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-14 12:13:17,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-14 12:13:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 12:13:17,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:17,167 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:17,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 12:13:17,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:17,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1282873403, now seen corresponding path program 1 times [2024-10-14 12:13:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:17,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072201239] [2024-10-14 12:13:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:17,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:17,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072201239] [2024-10-14 12:13:17,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072201239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:17,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:17,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:13:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037088502] [2024-10-14 12:13:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:17,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:13:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:17,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:13:17,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:13:17,287 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:17,407 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2024-10-14 12:13:17,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:13:17,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-14 12:13:17,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:17,410 INFO L225 Difference]: With dead ends: 345 [2024-10-14 12:13:17,410 INFO L226 Difference]: Without dead ends: 208 [2024-10-14 12:13:17,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-14 12:13:17,413 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:17,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 158 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:13:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-14 12:13:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2024-10-14 12:13:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 149 states have internal predecessors, (196), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 12:13:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2024-10-14 12:13:17,443 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 144 [2024-10-14 12:13:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:17,443 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2024-10-14 12:13:17,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2024-10-14 12:13:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 12:13:17,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:17,446 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:17,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 12:13:17,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:17,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1922919577, now seen corresponding path program 1 times [2024-10-14 12:13:17,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:17,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251789508] [2024-10-14 12:13:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:17,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251789508] [2024-10-14 12:13:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251789508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:17,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:13:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007500083] [2024-10-14 12:13:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:17,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:13:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:17,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:13:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:13:17,658 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:17,845 INFO L93 Difference]: Finished difference Result 503 states and 704 transitions. [2024-10-14 12:13:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:13:17,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-14 12:13:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:17,848 INFO L225 Difference]: With dead ends: 503 [2024-10-14 12:13:17,848 INFO L226 Difference]: Without dead ends: 324 [2024-10-14 12:13:17,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:13:17,849 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:17,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 366 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:13:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-14 12:13:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 227. [2024-10-14 12:13:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 171 states have internal predecessors, (219), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-14 12:13:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2024-10-14 12:13:17,886 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 144 [2024-10-14 12:13:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:17,887 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2024-10-14 12:13:17,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2024-10-14 12:13:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 12:13:17,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:17,889 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:17,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 12:13:17,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:17,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash -932675079, now seen corresponding path program 1 times [2024-10-14 12:13:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694123260] [2024-10-14 12:13:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:13:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:13:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:13:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:13:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:13:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:13:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:13:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:13:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:13:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:13:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:13:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:13:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:13:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:13:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:13:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:13:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 12:13:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 12:13:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 12:13:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 12:13:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:13:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 12:13:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:13:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694123260] [2024-10-14 12:13:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694123260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:17,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:17,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:13:17,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260122080] [2024-10-14 12:13:17,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:13:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:13:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:13:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:13:17,988 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:18,116 INFO L93 Difference]: Finished difference Result 431 states and 598 transitions. [2024-10-14 12:13:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:13:18,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-14 12:13:18,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:18,118 INFO L225 Difference]: With dead ends: 431 [2024-10-14 12:13:18,118 INFO L226 Difference]: Without dead ends: 252 [2024-10-14 12:13:18,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-14 12:13:18,119 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:18,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 180 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:13:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-14 12:13:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 214. [2024-10-14 12:13:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 159 states have internal predecessors, (202), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:13:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 298 transitions. [2024-10-14 12:13:18,152 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 298 transitions. Word has length 144 [2024-10-14 12:13:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:18,153 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 298 transitions. [2024-10-14 12:13:18,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 298 transitions. [2024-10-14 12:13:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 12:13:18,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:18,155 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 12:13:18,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1952165040, now seen corresponding path program 1 times [2024-10-14 12:13:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:13:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738043199] [2024-10-14 12:13:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:13:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 12:13:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189853497] [2024-10-14 12:13:18,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:18,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:13:18,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:13:18,242 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-14 12:13:18,243 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-14 12:13:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:13:18,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:13:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:13:18,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:13:18,891 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:13:18,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:13:18,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 12:13:19,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 12:13:19,098 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:13:19,205 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:13:19,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:13:19 BoogieIcfgContainer [2024-10-14 12:13:19,211 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:13:19,212 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:13:19,212 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:13:19,212 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:13:19,213 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:12:52" (3/4) ... [2024-10-14 12:13:19,215 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:13:19,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:13:19,217 INFO L158 Benchmark]: Toolchain (without parser) took 28321.43ms. Allocated memory was 176.2MB in the beginning and 408.9MB in the end (delta: 232.8MB). Free memory was 106.7MB in the beginning and 255.3MB in the end (delta: -148.6MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2024-10-14 12:13:19,217 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 113.2MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:13:19,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.23ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 91.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 12:13:19,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.10ms. Allocated memory is still 176.2MB. Free memory was 91.6MB in the beginning and 87.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 12:13:19,218 INFO L158 Benchmark]: Boogie Preprocessor took 81.97ms. Allocated memory is still 176.2MB. Free memory was 87.9MB in the beginning and 83.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 12:13:19,218 INFO L158 Benchmark]: RCFGBuilder took 753.75ms. Allocated memory is still 176.2MB. Free memory was 83.1MB in the beginning and 140.2MB in the end (delta: -57.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 12:13:19,219 INFO L158 Benchmark]: TraceAbstraction took 27027.75ms. Allocated memory was 176.2MB in the beginning and 408.9MB in the end (delta: 232.8MB). Free memory was 140.2MB in the beginning and 256.4MB in the end (delta: -116.2MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2024-10-14 12:13:19,219 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 408.9MB. Free memory was 256.4MB in the beginning and 255.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:13:19,221 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.22ms. Allocated memory is still 113.2MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.23ms. Allocated memory is still 176.2MB. Free memory was 106.4MB in the beginning and 91.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.10ms. Allocated memory is still 176.2MB. Free memory was 91.6MB in the beginning and 87.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.97ms. Allocated memory is still 176.2MB. Free memory was 87.9MB in the beginning and 83.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 753.75ms. Allocated memory is still 176.2MB. Free memory was 83.1MB in the beginning and 140.2MB in the end (delta: -57.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27027.75ms. Allocated memory was 176.2MB in the beginning and 408.9MB in the end (delta: 232.8MB). Free memory was 140.2MB in the beginning and 256.4MB in the end (delta: -116.2MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 408.9MB. Free memory was 256.4MB in the beginning and 255.3MB 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 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L127] RET updateVariables() [L128] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L60] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32767, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119-L120] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 13, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1106 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1106 mSDsluCounter, 4169 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2984 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2608 IncrementalHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 1185 mSDtfsCounter, 2608 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 553 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 2001 NumberOfCodeBlocks, 2001 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1699 ConstructedInterpolants, 0 QuantifiedInterpolants, 11047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 11088/11088 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-14 12:13:19,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-84.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 e5e6f5c277a9443bc03588ce855c247558c509f1528d6c079343ba850cfa2ecb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:13:21,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:13:21,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:13:21,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:13:21,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:13:21,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:13:21,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:13:21,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:13:21,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:13:21,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:13:21,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:13:21,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:13:21,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:13:21,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:13:21,623 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:13:21,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:13:21,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:13:21,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:13:21,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:13:21,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:13:21,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:13:21,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:13:21,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:13:21,631 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:13:21,631 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:13:21,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:13:21,632 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:13:21,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:13:21,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:13:21,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:13:21,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:13:21,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:13:21,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:13:21,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:13:21,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:13:21,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:13:21,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:13:21,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:13:21,637 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:13:21,637 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:13:21,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:13:21,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:13:21,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:13:21,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:13:21,638 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:13:21,639 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 -> e5e6f5c277a9443bc03588ce855c247558c509f1528d6c079343ba850cfa2ecb [2024-10-14 12:13:22,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:13:22,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:13:22,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:13:22,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:13:22,034 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:13:22,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-84.i [2024-10-14 12:13:23,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:13:23,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:13:23,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-84.i [2024-10-14 12:13:23,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0804bbbe3/4ad50550022447f28a90dd67d1505b69/FLAG88f668d44 [2024-10-14 12:13:23,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0804bbbe3/4ad50550022447f28a90dd67d1505b69 [2024-10-14 12:13:23,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:13:23,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:13:23,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:13:23,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:13:23,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:13:23,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:13:23" (1/1) ... [2024-10-14 12:13:23,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c1268a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:23, skipping insertion in model container [2024-10-14 12:13:23,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:13:23" (1/1) ... [2024-10-14 12:13:23,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:13:24,127 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-84.i[915,928] [2024-10-14 12:13:24,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:13:24,250 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:13:24,266 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-84.i[915,928] [2024-10-14 12:13:24,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:13:24,325 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:13:24,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24 WrapperNode [2024-10-14 12:13:24,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:13:24,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:13:24,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:13:24,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:13:24,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,390 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-14 12:13:24,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:13:24,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:13:24,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:13:24,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:13:24,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,428 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-14 12:13:24,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:13:24,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:13:24,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:13:24,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:13:24,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (1/1) ... [2024-10-14 12:13:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:13:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:13:24,506 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-14 12:13:24,513 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-14 12:13:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:13:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:13:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:13:24,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:13:24,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:13:24,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:13:24,655 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:13:24,658 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:13:25,179 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 12:13:25,180 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:13:25,244 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:13:25,244 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:13:25,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:13:25 BoogieIcfgContainer [2024-10-14 12:13:25,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:13:25,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:13:25,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:13:25,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:13:25,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:13:23" (1/3) ... [2024-10-14 12:13:25,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792ce1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:13:25, skipping insertion in model container [2024-10-14 12:13:25,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:13:24" (2/3) ... [2024-10-14 12:13:25,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792ce1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:13:25, skipping insertion in model container [2024-10-14 12:13:25,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:13:25" (3/3) ... [2024-10-14 12:13:25,257 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-84.i [2024-10-14 12:13:25,277 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:13:25,277 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:13:25,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:13:25,358 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;@58c598a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:13:25,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:13:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:13:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 12:13:25,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:25,376 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:25,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:25,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash -153112892, now seen corresponding path program 1 times [2024-10-14 12:13:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:13:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272484434] [2024-10-14 12:13:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:25,395 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-14 12:13:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:13:25,398 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-14 12:13:25,400 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-14 12:13:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:25,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:13:25,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:13:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-10-14 12:13:25,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:13:25,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:13:25,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272484434] [2024-10-14 12:13:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272484434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:25,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:13:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068219765] [2024-10-14 12:13:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:25,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:13:25,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:13:25,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:13:25,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:13:25,773 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 12:13:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:25,869 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2024-10-14 12:13:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:13:25,883 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-10-14 12:13:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:25,895 INFO L225 Difference]: With dead ends: 111 [2024-10-14 12:13:25,895 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 12:13:25,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-14 12:13:25,904 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:25,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:13:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 12:13:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 12:13:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:13:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2024-10-14 12:13:25,962 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 84 transitions. Word has length 135 [2024-10-14 12:13:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:25,962 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 84 transitions. [2024-10-14 12:13:25,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 12:13:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 84 transitions. [2024-10-14 12:13:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 12:13:25,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:25,971 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:25,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 12:13:26,172 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-14 12:13:26,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:26,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1571604612, now seen corresponding path program 1 times [2024-10-14 12:13:26,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:13:26,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605589186] [2024-10-14 12:13:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:26,175 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-14 12:13:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:13:26,176 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-14 12:13:26,178 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-14 12:13:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:26,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 12:13:26,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:13:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:13:26,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:13:26,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:13:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605589186] [2024-10-14 12:13:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605589186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:13:26,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:13:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:13:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292858799] [2024-10-14 12:13:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:13:26,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:13:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:13:26,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:13:26,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:13:26,471 INFO L87 Difference]: Start difference. First operand 55 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:13:26,567 INFO L93 Difference]: Finished difference Result 109 states and 167 transitions. [2024-10-14 12:13:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:13:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-14 12:13:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:13:26,581 INFO L225 Difference]: With dead ends: 109 [2024-10-14 12:13:26,581 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 12:13:26,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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-14 12:13:26,584 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:13:26,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:13:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 12:13:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 12:13:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:13:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2024-10-14 12:13:26,596 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 135 [2024-10-14 12:13:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:13:26,598 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2024-10-14 12:13:26,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:13:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2024-10-14 12:13:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 12:13:26,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:13:26,600 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:13:26,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 12:13:26,801 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-14 12:13:26,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:13:26,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:13:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash -948355322, now seen corresponding path program 1 times [2024-10-14 12:13:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:13:26,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717602136] [2024-10-14 12:13:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:13:26,803 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-14 12:13:26,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:13:26,806 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-14 12:13:26,807 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-14 12:13:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:13:27,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 12:13:27,075 INFO L278 TraceCheckSpWp]: Computing forward predicates...