./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_fillercode_fillercodesize_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_fillercode_fillercodesize_normal_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 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:55:49,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:55:49,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:55:49,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:55:49,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:55:49,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:55:49,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:55:49,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:55:49,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:55:49,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:55:49,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:55:49,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:55:49,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:55:49,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:55:49,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:55:49,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:55:49,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:55:49,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:55:49,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:55:49,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:55:49,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:55:49,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:55:49,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:55:49,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:55:49,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:55:49,778 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:55:49,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:55:49,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:55:49,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:55:49,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:55:49,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:55:49,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:55:49,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:55:49,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:55:49,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:55:49,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:55:49,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:55:49,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:55:49,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:55:49,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:55:49,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:55:49,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:55:49,785 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 -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-11-20 02:55:50,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:55:50,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:55:50,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:55:50,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:55:50,064 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:55:50,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-20 02:55:51,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:55:51,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:55:51,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-20 02:55:51,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db1bf7ac/9c260799b5064247b83660086566d450/FLAG0c1acf9f3 [2024-11-20 02:55:51,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db1bf7ac/9c260799b5064247b83660086566d450 [2024-11-20 02:55:51,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:55:51,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:55:51,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:55:51,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:55:51,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:55:51,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:55:51" (1/1) ... [2024-11-20 02:55:51,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebb644b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:51, skipping insertion in model container [2024-11-20 02:55:51,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:55:51" (1/1) ... [2024-11-20 02:55:51,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:55:52,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-11-20 02:55:52,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:55:52,181 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:55:52,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-11-20 02:55:52,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:55:52,246 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:55:52,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52 WrapperNode [2024-11-20 02:55:52,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:55:52,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:55:52,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:55:52,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:55:52,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,305 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-20 02:55:52,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:55:52,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:55:52,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:55:52,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:55:52,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,353 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:55:52,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:55:52,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:55:52,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:55:52,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:55:52,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (1/1) ... [2024-11-20 02:55:52,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:55:52,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:55:52,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:55:52,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:55:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:55:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:55:52,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:55:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:55:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:55:52,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:55:52,557 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:55:52,560 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:55:53,061 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-20 02:55:53,061 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:55:53,078 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:55:53,079 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:55:53,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:55:53 BoogieIcfgContainer [2024-11-20 02:55:53,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:55:53,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:55:53,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:55:53,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:55:53,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:55:51" (1/3) ... [2024-11-20 02:55:53,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6863fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:55:53, skipping insertion in model container [2024-11-20 02:55:53,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:55:52" (2/3) ... [2024-11-20 02:55:53,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6863fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:55:53, skipping insertion in model container [2024-11-20 02:55:53,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:55:53" (3/3) ... [2024-11-20 02:55:53,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-20 02:55:53,111 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:55:53,112 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:55:53,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:55:53,195 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;@51d087b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:55:53,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:55:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 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-11-20 02:55:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:55:53,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:55:53,217 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-11-20 02:55:53,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:55:53,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:55:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1756229400, now seen corresponding path program 1 times [2024-11-20 02:55:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:55:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574495669] [2024-11-20 02:55:53,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:55:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:55:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:55:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:55:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:55:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:55:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:55:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:55:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:55:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:55:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:55:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:55:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:55:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:55:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:55:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:55:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:55:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:55:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:55:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:55:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:55:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:55:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:55:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:55:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:55:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:55:53,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574495669] [2024-11-20 02:55:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574495669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:55:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:55:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:55:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886179849] [2024-11-20 02:55:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:55:53,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:55:53,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:55:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:55:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:55:53,722 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-11-20 02:55:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:55:53,754 INFO L93 Difference]: Finished difference Result 155 states and 262 transitions. [2024-11-20 02:55:53,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:55:53,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 145 [2024-11-20 02:55:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:55:53,763 INFO L225 Difference]: With dead ends: 155 [2024-11-20 02:55:53,764 INFO L226 Difference]: Without dead ends: 77 [2024-11-20 02:55:53,768 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-11-20 02:55:53,771 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:55:53,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:55:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-20 02:55:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-20 02:55:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 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-11-20 02:55:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-20 02:55:53,825 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 145 [2024-11-20 02:55:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:55:53,825 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-20 02:55:53,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-11-20 02:55:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-20 02:55:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:55:53,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:55:53,831 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-11-20 02:55:53,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:55:53,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:55:53,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:55:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 394550616, now seen corresponding path program 1 times [2024-11-20 02:55:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:55:53,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834632547] [2024-11-20 02:55:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:55:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:55:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:55:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:55:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:55:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:55:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:55:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:55:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:55:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:55:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:55:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:55:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:55:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:55:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:55:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:55:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:55:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:55:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:55:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:55:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:55:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:55:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:55:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:55:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:55:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:55:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834632547] [2024-11-20 02:55:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834632547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:55:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:55:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:55:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447368822] [2024-11-20 02:55:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:55:54,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:55:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:55:54,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:55:54,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:55:54,334 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-11-20 02:55:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:55:54,381 INFO L93 Difference]: Finished difference Result 151 states and 229 transitions. [2024-11-20 02:55:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:55:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 145 [2024-11-20 02:55:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:55:54,385 INFO L225 Difference]: With dead ends: 151 [2024-11-20 02:55:54,387 INFO L226 Difference]: Without dead ends: 77 [2024-11-20 02:55:54,388 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-11-20 02:55:54,389 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:55:54,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:55:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-20 02:55:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-20 02:55:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 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-11-20 02:55:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-20 02:55:54,408 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 145 [2024-11-20 02:55:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:55:54,411 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-20 02:55:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-11-20 02:55:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-20 02:55:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:55:54,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:55:54,413 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-11-20 02:55:54,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:55:54,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:55:54,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:55:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 652716054, now seen corresponding path program 1 times [2024-11-20 02:55:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:55:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467459571] [2024-11-20 02:55:54,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:55:54,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:55:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:55:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:55:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:55:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:55:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:55:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:55:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:55:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:55:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:55:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:55:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:55:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:55:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:55:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:55:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:55:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:55:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:55:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:55:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:55:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:55:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:55:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:55:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:55:57,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:55:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467459571] [2024-11-20 02:55:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467459571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:55:57,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:55:57,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:55:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288614094] [2024-11-20 02:55:57,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:55:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:55:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:55:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:55:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:55:57,540 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-20 02:55:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:55:58,202 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2024-11-20 02:55:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:55:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 145 [2024-11-20 02:55:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:55:58,205 INFO L225 Difference]: With dead ends: 186 [2024-11-20 02:55:58,205 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 02:55:58,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:55:58,207 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 69 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:55:58,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 395 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:55:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 02:55:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-20 02:55:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.325) internal successors, (106), 81 states have internal predecessors, (106), 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-11-20 02:55:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-11-20 02:55:58,226 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 145 [2024-11-20 02:55:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:55:58,229 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-11-20 02:55:58,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-20 02:55:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-11-20 02:55:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 02:55:58,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:55:58,231 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, 1] [2024-11-20 02:55:58,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:55:58,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:55:58,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:55:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1697318672, now seen corresponding path program 1 times [2024-11-20 02:55:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:55:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12008414] [2024-11-20 02:55:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:55:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:55:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:55:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:55:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:55:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:55:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:55:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:55:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:55:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:55:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:55:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:55:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:55:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:55:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:55:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:55:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:55:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:55:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:55:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:55:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:55:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:55:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:55:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:55:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:55:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:55:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12008414] [2024-11-20 02:55:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12008414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:55:59,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:55:59,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:55:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011580316] [2024-11-20 02:55:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:55:59,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:55:59,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:55:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:55:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:55:59,218 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-11-20 02:55:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:55:59,458 INFO L93 Difference]: Finished difference Result 247 states and 354 transitions. [2024-11-20 02:55:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:55:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 146 [2024-11-20 02:55:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:55:59,463 INFO L225 Difference]: With dead ends: 247 [2024-11-20 02:55:59,463 INFO L226 Difference]: Without dead ends: 141 [2024-11-20 02:55:59,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:55:59,465 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:55:59,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 459 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:55:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-20 02:55:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-20 02:55:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.320754716981132) internal successors, (140), 108 states have internal predecessors, (140), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:55:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-20 02:55:59,482 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 146 [2024-11-20 02:55:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:55:59,482 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-20 02:55:59,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-11-20 02:55:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-20 02:55:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 02:55:59,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:55:59,485 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, 1] [2024-11-20 02:55:59,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:55:59,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:55:59,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:55:59,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1586531374, now seen corresponding path program 1 times [2024-11-20 02:55:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:55:59,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749611972] [2024-11-20 02:55:59,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:55:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:55:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:55:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:55:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:55:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:55:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:56:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:56:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:56:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:56:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:56:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:56:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:56:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:56:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:56:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:56:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:56:00,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:00,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749611972] [2024-11-20 02:56:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749611972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:00,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:56:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051303668] [2024-11-20 02:56:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:00,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:56:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:00,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:56:00,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:56:00,064 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-11-20 02:56:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:00,361 INFO L93 Difference]: Finished difference Result 289 states and 404 transitions. [2024-11-20 02:56:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:56:00,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 146 [2024-11-20 02:56:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:00,364 INFO L225 Difference]: With dead ends: 289 [2024-11-20 02:56:00,364 INFO L226 Difference]: Without dead ends: 154 [2024-11-20 02:56:00,365 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-11-20 02:56:00,369 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 44 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:00,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 489 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:56:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-20 02:56:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2024-11-20 02:56:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 90 states have internal predecessors, (113), 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-11-20 02:56:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2024-11-20 02:56:00,388 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 146 [2024-11-20 02:56:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:00,389 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2024-11-20 02:56:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-11-20 02:56:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-11-20 02:56:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 02:56:00,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:00,391 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, 1, 1] [2024-11-20 02:56:00,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:56:00,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:00,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:00,392 INFO L85 PathProgramCache]: Analyzing trace with hash -14262287, now seen corresponding path program 1 times [2024-11-20 02:56:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:00,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831080787] [2024-11-20 02:56:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:56:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:56:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:56:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:56:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:56:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:56:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:56:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:56:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:56:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:56:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:56:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:04,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831080787] [2024-11-20 02:56:04,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831080787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:04,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 02:56:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356174595] [2024-11-20 02:56:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:04,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:56:04,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:04,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:56:04,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:56:04,326 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-11-20 02:56:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:05,492 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2024-11-20 02:56:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:56:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 147 [2024-11-20 02:56:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:05,496 INFO L225 Difference]: With dead ends: 328 [2024-11-20 02:56:05,496 INFO L226 Difference]: Without dead ends: 218 [2024-11-20 02:56:05,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:56:05,497 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:05,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 554 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 02:56:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-20 02:56:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2024-11-20 02:56:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 121 states have internal predecessors, (156), 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-11-20 02:56:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-20 02:56:05,517 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-20 02:56:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:05,517 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-20 02:56:05,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-11-20 02:56:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-20 02:56:05,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 02:56:05,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:05,519 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, 1, 1] [2024-11-20 02:56:05,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:56:05,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:05,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:05,520 INFO L85 PathProgramCache]: Analyzing trace with hash 686802291, now seen corresponding path program 1 times [2024-11-20 02:56:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:05,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757542418] [2024-11-20 02:56:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:56:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:56:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:56:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:56:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:56:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:56:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:56:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:56:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:56:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:56:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:56:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757542418] [2024-11-20 02:56:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757542418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:56:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365571539] [2024-11-20 02:56:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:10,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:56:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:56:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:56:10,948 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-11-20 02:56:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:12,438 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2024-11-20 02:56:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 02:56:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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 147 [2024-11-20 02:56:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:12,442 INFO L225 Difference]: With dead ends: 365 [2024-11-20 02:56:12,442 INFO L226 Difference]: Without dead ends: 224 [2024-11-20 02:56:12,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-20 02:56:12,444 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:12,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 676 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 02:56:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-20 02:56:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2024-11-20 02:56:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 121 states have internal predecessors, (156), 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-11-20 02:56:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-20 02:56:12,479 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-20 02:56:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:12,479 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-20 02:56:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-11-20 02:56:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-20 02:56:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 02:56:12,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:12,483 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, 1, 1, 1] [2024-11-20 02:56:12,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:56:12,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:12,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:12,483 INFO L85 PathProgramCache]: Analyzing trace with hash 341528847, now seen corresponding path program 1 times [2024-11-20 02:56:12,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:12,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717247061] [2024-11-20 02:56:12,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:12,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:56:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:56:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:56:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:56:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:56:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:56:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:56:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:56:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:56:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:56:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:56:12,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:12,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717247061] [2024-11-20 02:56:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717247061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:12,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:12,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:56:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545293507] [2024-11-20 02:56:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:56:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:56:12,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:12,612 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-20 02:56:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:12,723 INFO L93 Difference]: Finished difference Result 360 states and 500 transitions. [2024-11-20 02:56:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:56:12,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 148 [2024-11-20 02:56:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:12,725 INFO L225 Difference]: With dead ends: 360 [2024-11-20 02:56:12,725 INFO L226 Difference]: Without dead ends: 219 [2024-11-20 02:56:12,726 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-11-20 02:56:12,727 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:12,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 173 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:56:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-20 02:56:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 188. [2024-11-20 02:56:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 157 states have internal predecessors, (204), 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-11-20 02:56:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 260 transitions. [2024-11-20 02:56:12,756 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 260 transitions. Word has length 148 [2024-11-20 02:56:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:12,757 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 260 transitions. [2024-11-20 02:56:12,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-20 02:56:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 260 transitions. [2024-11-20 02:56:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 02:56:12,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:12,759 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, 1, 1, 1] [2024-11-20 02:56:12,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:56:12,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:12,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1974933933, now seen corresponding path program 1 times [2024-11-20 02:56:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:12,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728815314] [2024-11-20 02:56:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:56:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:56:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:56:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:56:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:56:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:56:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:56:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:56:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:56:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:56:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:56:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728815314] [2024-11-20 02:56:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728815314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:56:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225137263] [2024-11-20 02:56:13,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:13,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:56:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:13,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:56:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:56:13,019 INFO L87 Difference]: Start difference. First operand 188 states and 260 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-11-20 02:56:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:13,187 INFO L93 Difference]: Finished difference Result 521 states and 722 transitions. [2024-11-20 02:56:13,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:56:13,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 148 [2024-11-20 02:56:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:13,191 INFO L225 Difference]: With dead ends: 521 [2024-11-20 02:56:13,194 INFO L226 Difference]: Without dead ends: 336 [2024-11-20 02:56:13,195 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-11-20 02:56:13,196 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 88 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:13,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 383 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:56:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-20 02:56:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 236. [2024-11-20 02:56:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.2808988764044944) internal successors, (228), 180 states have internal predecessors, (228), 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-11-20 02:56:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2024-11-20 02:56:13,232 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 148 [2024-11-20 02:56:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:13,235 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2024-11-20 02:56:13,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-11-20 02:56:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2024-11-20 02:56:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 02:56:13,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:13,237 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, 1, 1, 1] [2024-11-20 02:56:13,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:56:13,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:13,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1687224997, now seen corresponding path program 1 times [2024-11-20 02:56:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:13,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242797345] [2024-11-20 02:56:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:56:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:56:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:56:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:56:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:56:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:56:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:56:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:56:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:56:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:56:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:56:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:56:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:56:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:56:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:56:13,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242797345] [2024-11-20 02:56:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242797345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:13,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:13,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:56:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493607124] [2024-11-20 02:56:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:13,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:56:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:13,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:56:13,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:13,343 INFO L87 Difference]: Start difference. First operand 236 states and 328 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-20 02:56:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:13,443 INFO L93 Difference]: Finished difference Result 448 states and 615 transitions. [2024-11-20 02:56:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:56:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 148 [2024-11-20 02:56:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:13,446 INFO L225 Difference]: With dead ends: 448 [2024-11-20 02:56:13,447 INFO L226 Difference]: Without dead ends: 263 [2024-11-20 02:56:13,448 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-11-20 02:56:13,449 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:13,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 193 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:56:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-20 02:56:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 221. [2024-11-20 02:56:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 165 states have (on average 1.2666666666666666) internal successors, (209), 166 states have internal predecessors, (209), 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-11-20 02:56:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 305 transitions. [2024-11-20 02:56:13,477 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 305 transitions. Word has length 148 [2024-11-20 02:56:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:13,477 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 305 transitions. [2024-11-20 02:56:13,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-20 02:56:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 305 transitions. [2024-11-20 02:56:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-20 02:56:13,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:13,480 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, 1, 1, 1, 1] [2024-11-20 02:56:13,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 02:56:13,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1655306804, now seen corresponding path program 1 times [2024-11-20 02:56:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:13,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118895930] [2024-11-20 02:56:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:56:13,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581256743] [2024-11-20 02:56:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:13,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:56:13,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:56:13,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:56:13,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:56:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:56:13,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:56:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:56:13,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:56:13,931 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:56:13,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:56:13,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 02:56:14,135 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,SelfDestructingSolverStorable10 [2024-11-20 02:56:14,139 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:14,263 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:56:14,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:56:14 BoogieIcfgContainer [2024-11-20 02:56:14,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:56:14,268 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:56:14,268 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:56:14,268 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:56:14,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:55:53" (3/4) ... [2024-11-20 02:56:14,271 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:56:14,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:56:14,273 INFO L158 Benchmark]: Toolchain (without parser) took 22429.94ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 110.0MB in the beginning and 133.7MB in the end (delta: -23.7MB). Peak memory consumption was 171.8MB. Max. memory is 16.1GB. [2024-11-20 02:56:14,273 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:56:14,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.92ms. Allocated memory is still 178.3MB. Free memory was 110.0MB in the beginning and 94.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 02:56:14,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.98ms. Allocated memory is still 178.3MB. Free memory was 94.2MB in the beginning and 90.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:56:14,273 INFO L158 Benchmark]: Boogie Preprocessor took 68.15ms. Allocated memory is still 178.3MB. Free memory was 90.6MB in the beginning and 85.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:56:14,273 INFO L158 Benchmark]: RCFGBuilder took 704.71ms. Allocated memory is still 178.3MB. Free memory was 85.4MB in the beginning and 59.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 02:56:14,274 INFO L158 Benchmark]: TraceAbstraction took 21183.90ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 58.6MB in the beginning and 134.8MB in the end (delta: -76.2MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-11-20 02:56:14,274 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 373.3MB. Free memory was 134.8MB in the beginning and 133.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:56:14,276 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 90.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.92ms. Allocated memory is still 178.3MB. Free memory was 110.0MB in the beginning and 94.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.98ms. Allocated memory is still 178.3MB. Free memory was 94.2MB in the beginning and 90.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.15ms. Allocated memory is still 178.3MB. Free memory was 90.6MB in the beginning and 85.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 704.71ms. Allocated memory is still 178.3MB. Free memory was 85.4MB in the beginning and 59.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21183.90ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 58.6MB in the beginning and 134.8MB in the end (delta: -76.2MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 373.3MB. Free memory was 134.8MB in the beginning and 133.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 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; VAL [isInitial=0, 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=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 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=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [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=2, 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=2, 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=2, 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=2, 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=2, 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=2, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=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=2, var_1_6=50, var_1_7=4, 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=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=2, var_1_6=50, var_1_7=4, 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=2, var_1_6=50, var_1_7=4, 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=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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, 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=2, var_1_6=50, var_1_7=4, 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=1, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, 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=2, var_1_6=50, var_1_7=4, 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=1, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, 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=2, var_1_6=50, var_1_7=4, 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=1, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=16, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=16, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, 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=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, 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=2, var_1_6=50, var_1_7=4, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 11, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 3550 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2444 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 1106 mSDtfsCounter, 1429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 1763 NumberOfCodeBlocks, 1763 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1455 ConstructedInterpolants, 0 QuantifiedInterpolants, 6174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 9240/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:56:14,353 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_fillercode_fillercodesize_normal_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 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:56:16,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:56:16,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:56:16,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:56:16,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:56:16,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:56:16,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:56:16,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:56:16,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:56:16,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:56:16,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:56:16,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:56:16,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:56:16,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:56:16,865 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:56:16,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:56:16,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:56:16,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:56:16,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:56:16,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:56:16,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:56:16,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:56:16,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:56:16,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:56:16,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:56:16,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:56:16,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:56:16,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:56:16,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:56:16,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:56:16,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:56:16,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:56:16,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:56:16,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:56:16,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:56:16,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:56:16,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:56:16,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:56:16,878 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:56:16,878 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:56:16,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:56:16,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:56:16,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:56:16,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:56:16,879 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 -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-11-20 02:56:17,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:56:17,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:56:17,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:56:17,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:56:17,243 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:56:17,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-20 02:56:18,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:56:19,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:56:19,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-20 02:56:19,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16fd6f27/16cebc955eb54ea69a538473c6c90e69/FLAG8ea7db85e [2024-11-20 02:56:19,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16fd6f27/16cebc955eb54ea69a538473c6c90e69 [2024-11-20 02:56:19,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:56:19,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:56:19,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:56:19,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:56:19,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:56:19,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77502a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19, skipping insertion in model container [2024-11-20 02:56:19,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:56:19,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-11-20 02:56:19,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:56:19,757 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:56:19,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i[913,926] [2024-11-20 02:56:19,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:56:19,834 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:56:19,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19 WrapperNode [2024-11-20 02:56:19,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:56:19,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:56:19,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:56:19,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:56:19,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,894 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-20 02:56:19,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:56:19,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:56:19,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:56:19,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:56:19,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,934 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:56:19,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:56:19,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:56:19,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:56:19,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:56:19,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (1/1) ... [2024-11-20 02:56:19,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:56:19,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:56:19,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:56:19,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:56:20,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:56:20,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:56:20,034 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:56:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:56:20,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:56:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:56:20,105 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:56:20,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:56:20,512 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 02:56:20,512 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:56:20,528 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:56:20,530 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:56:20,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:20 BoogieIcfgContainer [2024-11-20 02:56:20,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:56:20,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:56:20,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:56:20,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:56:20,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:56:19" (1/3) ... [2024-11-20 02:56:20,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2704c8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:20, skipping insertion in model container [2024-11-20 02:56:20,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:19" (2/3) ... [2024-11-20 02:56:20,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2704c8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:20, skipping insertion in model container [2024-11-20 02:56:20,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:20" (3/3) ... [2024-11-20 02:56:20,542 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-20 02:56:20,560 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:56:20,560 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:56:20,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:56:20,627 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;@6dff7b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:56:20,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:56:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 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-11-20 02:56:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 02:56:20,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:20,648 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] [2024-11-20 02:56:20,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:20,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2103567624, now seen corresponding path program 1 times [2024-11-20 02:56:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:56:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667857072] [2024-11-20 02:56:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:20,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:56:20,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:56:20,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:56:20,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:56:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:20,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:56:20,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:56:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-20 02:56:21,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:56:21,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:56:21,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667857072] [2024-11-20 02:56:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667857072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:21,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:21,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:56:21,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036883491] [2024-11-20 02:56:21,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:21,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:56:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:56:21,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:56:21,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:56:21,058 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-20 02:56:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:21,083 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-20 02:56:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:56:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 139 [2024-11-20 02:56:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:21,090 INFO L225 Difference]: With dead ends: 119 [2024-11-20 02:56:21,090 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 02:56:21,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:56:21,097 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:21,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:56:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 02:56:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 02:56:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 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-11-20 02:56:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-20 02:56:21,146 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 139 [2024-11-20 02:56:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:21,146 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-20 02:56:21,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-20 02:56:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-20 02:56:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 02:56:21,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:21,151 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] [2024-11-20 02:56:21,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:56:21,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:56:21,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:21,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash -176932552, now seen corresponding path program 1 times [2024-11-20 02:56:21,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:56:21,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394358162] [2024-11-20 02:56:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:21,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:56:21,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:56:21,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:56:21,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:56:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:21,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 02:56:21,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:56:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:56:21,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:56:21,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:56:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394358162] [2024-11-20 02:56:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394358162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:21,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:21,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:56:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962702059] [2024-11-20 02:56:21,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:21,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:56:21,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:56:21,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:56:21,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:21,657 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (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-11-20 02:56:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:21,783 INFO L93 Difference]: Finished difference Result 115 states and 173 transitions. [2024-11-20 02:56:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:56:21,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (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 139 [2024-11-20 02:56:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:21,794 INFO L225 Difference]: With dead ends: 115 [2024-11-20 02:56:21,795 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 02:56:21,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 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-11-20 02:56:21,797 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:21,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:56:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 02:56:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 02:56:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 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-11-20 02:56:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-20 02:56:21,814 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 139 [2024-11-20 02:56:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:21,816 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-20 02:56:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (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-11-20 02:56:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-20 02:56:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-20 02:56:21,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:21,819 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] [2024-11-20 02:56:21,828 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-11-20 02:56:22,019 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-11-20 02:56:22,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:22,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash -986279178, now seen corresponding path program 1 times [2024-11-20 02:56:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:56:22,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97886439] [2024-11-20 02:56:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:22,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:56:22,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:56:22,026 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-11-20 02:56:22,027 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-11-20 02:56:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:22,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 02:56:22,256 INFO L278 TraceCheckSpWp]: Computing forward predicates...