./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-c7c6ca5-m [2024-11-08 20:03:02,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:03:02,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:03:02,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:03:02,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:03:02,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:03:02,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:03:02,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:03:02,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:03:02,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:03:02,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:03:02,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:03:02,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:03:02,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:03:02,520 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:03:02,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:03:02,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:03:02,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:03:02,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:03:02,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:03:02,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:03:02,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:03:02,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:03:02,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:03:02,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:03:02,524 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:03:02,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:03:02,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:03:02,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:03:02,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:03:02,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:03:02,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:03:02,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:03:02,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:03:02,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:03:02,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:03:02,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:03:02,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:03:02,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:03:02,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:03:02,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:03:02,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:03:02,529 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-08 20:03:02,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:03:02,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:03:02,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:03:02,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:03:02,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:03:02,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 20:03:04,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:03:04,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:03:04,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 20:03:04,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b4e7322/dcc08117f14447b5ac67368b00beee1f/FLAGb078dab56 [2024-11-08 20:03:04,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b4e7322/dcc08117f14447b5ac67368b00beee1f [2024-11-08 20:03:04,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:03:04,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:03:04,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:03:04,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:03:04,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:03:04,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cde4ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04, skipping insertion in model container [2024-11-08 20:03:04,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:03:04,747 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-08 20:03:04,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:03:04,810 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:03:04,821 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-08 20:03:04,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:03:04,879 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:03:04,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04 WrapperNode [2024-11-08 20:03:04,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:03:04,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:03:04,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:03:04,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:03:04,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,947 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-08 20:03:04,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:03:04,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:03:04,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:03:04,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:03:04,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,984 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-08 20:03:04,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:04,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:05,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:05,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:05,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:03:05,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:03:05,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:03:05,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:03:05,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (1/1) ... [2024-11-08 20:03:05,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:03:05,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:03:05,057 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-08 20:03:05,059 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-08 20:03:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:03:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:03:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:03:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:03:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:03:05,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:03:05,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:03:05,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:03:05,568 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 20:03:05,568 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:03:05,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:03:05,581 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:03:05,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:03:05 BoogieIcfgContainer [2024-11-08 20:03:05,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:03:05,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:03:05,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:03:05,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:03:05,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:03:04" (1/3) ... [2024-11-08 20:03:05,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7268da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:03:05, skipping insertion in model container [2024-11-08 20:03:05,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:04" (2/3) ... [2024-11-08 20:03:05,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7268da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:03:05, skipping insertion in model container [2024-11-08 20:03:05,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:03:05" (3/3) ... [2024-11-08 20:03:05,594 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 20:03:05,609 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:03:05,609 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:03:05,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:03:05,671 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;@17ad716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:03:05,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:03:05,676 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-08 20:03:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 20:03:05,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:05,694 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-08 20:03:05,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:05,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1756229400, now seen corresponding path program 1 times [2024-11-08 20:03:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29456545] [2024-11-08 20:03:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:05,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,250 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-08 20:03:06,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29456545] [2024-11-08 20:03:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29456545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:06,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:06,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:03:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380419725] [2024-11-08 20:03:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:06,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:03:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:03:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:03:06,293 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-08 20:03:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:06,322 INFO L93 Difference]: Finished difference Result 155 states and 262 transitions. [2024-11-08 20:03:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:03:06,325 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-08 20:03:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:06,334 INFO L225 Difference]: With dead ends: 155 [2024-11-08 20:03:06,335 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 20:03:06,339 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-08 20:03:06,342 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-08 20:03:06,343 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-08 20:03:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 20:03:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 20:03:06,388 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-08 20:03:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-08 20:03:06,395 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 145 [2024-11-08 20:03:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-08 20:03:06,396 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-08 20:03:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-08 20:03:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 20:03:06,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:06,401 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-08 20:03:06,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:03:06,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:06,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash 394550616, now seen corresponding path program 1 times [2024-11-08 20:03:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:06,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139798930] [2024-11-08 20:03:06,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:06,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:06,984 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-08 20:03:06,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:06,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139798930] [2024-11-08 20:03:06,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139798930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:06,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:06,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:03:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654650940] [2024-11-08 20:03:06,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:06,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:03:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:03:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:03:06,997 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-08 20:03:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:07,038 INFO L93 Difference]: Finished difference Result 151 states and 229 transitions. [2024-11-08 20:03:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:03:07,039 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-08 20:03:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:07,044 INFO L225 Difference]: With dead ends: 151 [2024-11-08 20:03:07,046 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 20:03:07,047 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-08 20:03:07,048 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-08 20:03:07,049 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-08 20:03:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 20:03:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 20:03:07,066 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-08 20:03:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-08 20:03:07,073 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 145 [2024-11-08 20:03:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:07,075 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-08 20:03:07,076 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-08 20:03:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-08 20:03:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 20:03:07,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:07,080 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-08 20:03:07,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:03:07,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:07,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash 652716054, now seen corresponding path program 1 times [2024-11-08 20:03:07,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:07,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227842001] [2024-11-08 20:03:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:10,428 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-08 20:03:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227842001] [2024-11-08 20:03:10,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227842001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:10,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:10,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:03:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728775151] [2024-11-08 20:03:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:10,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:03:10,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:03:10,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:03:10,434 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-08 20:03:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:11,489 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2024-11-08 20:03:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:03:11,490 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-08 20:03:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:11,492 INFO L225 Difference]: With dead ends: 186 [2024-11-08 20:03:11,492 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 20:03:11,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:03:11,494 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-08 20:03:11,494 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-08 20:03:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 20:03:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-08 20:03:11,515 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-08 20:03:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-11-08 20:03:11,516 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 145 [2024-11-08 20:03:11,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:11,517 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-11-08 20:03:11,520 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-08 20:03:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-11-08 20:03:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 20:03:11,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:11,523 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-08 20:03:11,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:03:11,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:11,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1697318672, now seen corresponding path program 1 times [2024-11-08 20:03:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873589622] [2024-11-08 20:03:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:12,511 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-08 20:03:12,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:12,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873589622] [2024-11-08 20:03:12,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873589622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:12,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:12,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:03:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159434634] [2024-11-08 20:03:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:12,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:03:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:12,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:03:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:03:12,515 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-08 20:03:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:12,771 INFO L93 Difference]: Finished difference Result 247 states and 354 transitions. [2024-11-08 20:03:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:03:12,774 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-08 20:03:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:12,776 INFO L225 Difference]: With dead ends: 247 [2024-11-08 20:03:12,777 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 20:03:12,780 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-08 20:03:12,783 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:03:12,784 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.2s Time] [2024-11-08 20:03:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 20:03:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-08 20:03:12,808 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-08 20:03:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-08 20:03:12,813 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 146 [2024-11-08 20:03:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:12,813 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-08 20:03:12,814 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-08 20:03:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-08 20:03:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 20:03:12,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:12,818 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-08 20:03:12,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:03:12,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:12,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1586531374, now seen corresponding path program 1 times [2024-11-08 20:03:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329088453] [2024-11-08 20:03:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:13,356 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-08 20:03:13,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:13,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329088453] [2024-11-08 20:03:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329088453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:13,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:03:13,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507869234] [2024-11-08 20:03:13,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:13,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:03:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:13,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:03:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:03:13,359 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-08 20:03:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:13,647 INFO L93 Difference]: Finished difference Result 289 states and 404 transitions. [2024-11-08 20:03:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:03:13,648 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-08 20:03:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:13,650 INFO L225 Difference]: With dead ends: 289 [2024-11-08 20:03:13,650 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 20:03:13,650 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-08 20:03:13,651 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-08 20:03:13,652 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-08 20:03:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 20:03:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2024-11-08 20:03:13,666 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-08 20:03:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2024-11-08 20:03:13,667 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 146 [2024-11-08 20:03:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:13,668 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2024-11-08 20:03:13,668 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-08 20:03:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-11-08 20:03:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 20:03:13,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:13,670 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-08 20:03:13,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:03:13,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:13,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash -14262287, now seen corresponding path program 1 times [2024-11-08 20:03:13,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662515040] [2024-11-08 20:03:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:18,167 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-08 20:03:18,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662515040] [2024-11-08 20:03:18,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662515040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:18,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 20:03:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734272569] [2024-11-08 20:03:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:18,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 20:03:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 20:03:18,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:03:18,170 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-08 20:03:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:19,209 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2024-11-08 20:03:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 20:03:19,210 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-08 20:03:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:19,212 INFO L225 Difference]: With dead ends: 328 [2024-11-08 20:03:19,213 INFO L226 Difference]: Without dead ends: 218 [2024-11-08 20:03:19,213 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-08 20:03:19,214 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.6s IncrementalHoareTripleChecker+Time [2024-11-08 20:03:19,214 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.6s Time] [2024-11-08 20:03:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-08 20:03:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2024-11-08 20:03:19,233 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-08 20:03:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-08 20:03:19,234 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-08 20:03:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:19,235 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-08 20:03:19,235 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-08 20:03:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-08 20:03:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 20:03:19,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:19,248 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-08 20:03:19,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:03:19,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:19,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash 686802291, now seen corresponding path program 1 times [2024-11-08 20:03:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986382775] [2024-11-08 20:03:19,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:24,182 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-08 20:03:24,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:24,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986382775] [2024-11-08 20:03:24,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986382775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:24,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:24,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 20:03:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537620266] [2024-11-08 20:03:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:24,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 20:03:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 20:03:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:03:24,185 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-08 20:03:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:25,711 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2024-11-08 20:03:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 20:03:25,712 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-08 20:03:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:25,714 INFO L225 Difference]: With dead ends: 365 [2024-11-08 20:03:25,714 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 20:03:25,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-08 20:03:25,717 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 20:03:25,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 676 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 20:03:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 20:03:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2024-11-08 20:03:25,739 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-08 20:03:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-08 20:03:25,741 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-08 20:03:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:25,744 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-08 20:03:25,744 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-08 20:03:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-08 20:03:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 20:03:25,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:25,746 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-08 20:03:25,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 20:03:25,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash 341528847, now seen corresponding path program 1 times [2024-11-08 20:03:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708223885] [2024-11-08 20:03:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:25,853 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-08 20:03:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708223885] [2024-11-08 20:03:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708223885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:25,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:25,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:03:25,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72819981] [2024-11-08 20:03:25,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:25,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:03:25,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:25,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:03:25,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:03:25,856 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-08 20:03:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:25,962 INFO L93 Difference]: Finished difference Result 360 states and 500 transitions. [2024-11-08 20:03:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:03:25,963 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-08 20:03:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:25,965 INFO L225 Difference]: With dead ends: 360 [2024-11-08 20:03:25,965 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 20:03:25,965 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-08 20:03:25,967 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-08 20:03:25,968 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-08 20:03:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 20:03:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 188. [2024-11-08 20:03:25,989 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-08 20:03:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 260 transitions. [2024-11-08 20:03:25,990 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 260 transitions. Word has length 148 [2024-11-08 20:03:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:25,991 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 260 transitions. [2024-11-08 20:03:25,991 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-08 20:03:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 260 transitions. [2024-11-08 20:03:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 20:03:25,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:25,994 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-08 20:03:25,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 20:03:25,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:25,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1974933933, now seen corresponding path program 1 times [2024-11-08 20:03:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:25,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713096635] [2024-11-08 20:03:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,280 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-08 20:03:26,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:26,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713096635] [2024-11-08 20:03:26,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713096635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:26,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:26,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:03:26,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723679963] [2024-11-08 20:03:26,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:26,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:03:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:26,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:03:26,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:03:26,284 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-08 20:03:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:26,468 INFO L93 Difference]: Finished difference Result 521 states and 722 transitions. [2024-11-08 20:03:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:03:26,469 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-08 20:03:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:26,472 INFO L225 Difference]: With dead ends: 521 [2024-11-08 20:03:26,472 INFO L226 Difference]: Without dead ends: 336 [2024-11-08 20:03:26,473 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-08 20:03:26,473 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-08 20:03:26,474 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-08 20:03:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-08 20:03:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 236. [2024-11-08 20:03:26,511 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-08 20:03:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2024-11-08 20:03:26,513 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 148 [2024-11-08 20:03:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:26,515 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2024-11-08 20:03:26,515 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-08 20:03:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2024-11-08 20:03:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 20:03:26,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:26,518 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-08 20:03:26,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 20:03:26,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:26,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1687224997, now seen corresponding path program 1 times [2024-11-08 20:03:26,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:26,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000766898] [2024-11-08 20:03:26,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:03:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:03:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:03:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:03:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:03:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:03:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:03:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:03:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:03:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:03:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:03:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 20:03:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:03:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 20:03:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:03:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 20:03:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 20:03:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 20:03:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 20:03:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 20:03:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 20:03:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 20:03:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:26,628 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-08 20:03:26,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:03:26,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000766898] [2024-11-08 20:03:26,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000766898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:26,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:26,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:03:26,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51461528] [2024-11-08 20:03:26,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:26,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:03:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:03:26,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:03:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:03:26,630 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-08 20:03:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:26,745 INFO L93 Difference]: Finished difference Result 448 states and 615 transitions. [2024-11-08 20:03:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:03:26,746 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-08 20:03:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:26,749 INFO L225 Difference]: With dead ends: 448 [2024-11-08 20:03:26,750 INFO L226 Difference]: Without dead ends: 263 [2024-11-08 20:03:26,751 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-08 20:03:26,752 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-08 20:03:26,752 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-08 20:03:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-08 20:03:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 221. [2024-11-08 20:03:26,778 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-08 20:03:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 305 transitions. [2024-11-08 20:03:26,780 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 305 transitions. Word has length 148 [2024-11-08 20:03:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:26,781 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 305 transitions. [2024-11-08 20:03:26,781 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-08 20:03:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 305 transitions. [2024-11-08 20:03:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 20:03:26,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:26,784 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-08 20:03:26,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 20:03:26,784 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:26,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1655306804, now seen corresponding path program 1 times [2024-11-08 20:03:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:03:26,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217296140] [2024-11-08 20:03:26,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:26,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:03:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:03:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41619468] [2024-11-08 20:03:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:03:26,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:03:26,882 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-08 20:03:26,885 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-08 20:03:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:03:27,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:03:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:03:27,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:03:27,322 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:03:27,324 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:03:27,345 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-08 20:03:27,529 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-08 20:03:27,533 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:03:27,648 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:03:27,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:03:27 BoogieIcfgContainer [2024-11-08 20:03:27,651 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:03:27,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:03:27,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:03:27,652 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:03:27,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:03:05" (3/4) ... [2024-11-08 20:03:27,655 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:03:27,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:03:27,656 INFO L158 Benchmark]: Toolchain (without parser) took 23114.79ms. Allocated memory was 184.5MB in the beginning and 331.4MB in the end (delta: 146.8MB). Free memory was 127.5MB in the beginning and 148.8MB in the end (delta: -21.3MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2024-11-08 20:03:27,656 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:03:27,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.94ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 111.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 20:03:27,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.32ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 107.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:03:27,657 INFO L158 Benchmark]: Boogie Preprocessor took 62.65ms. Allocated memory is still 184.5MB. Free memory was 107.2MB in the beginning and 102.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:03:27,657 INFO L158 Benchmark]: RCFGBuilder took 570.64ms. Allocated memory is still 184.5MB. Free memory was 102.8MB in the beginning and 76.3MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 20:03:27,658 INFO L158 Benchmark]: TraceAbstraction took 22066.87ms. Allocated memory was 184.5MB in the beginning and 331.4MB in the end (delta: 146.8MB). Free memory was 75.6MB in the beginning and 148.8MB in the end (delta: -73.3MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2024-11-08 20:03:27,658 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 331.4MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:03:27,659 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.20ms. Allocated memory is still 184.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.94ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 111.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.32ms. Allocated memory is still 184.5MB. Free memory was 111.4MB in the beginning and 107.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.65ms. Allocated memory is still 184.5MB. Free memory was 107.2MB in the beginning and 102.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 570.64ms. Allocated memory is still 184.5MB. Free memory was 102.8MB in the beginning and 76.3MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22066.87ms. Allocated memory was 184.5MB in the beginning and 331.4MB in the end (delta: 146.8MB). Free memory was 75.6MB in the beginning and 148.8MB in the end (delta: -73.3MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 331.4MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119. 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, 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=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=32768, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 11, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 3550 SdHoareTripleChecker+Invalid, 2.3s 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.7s 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.3s 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-08 20:03:27,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-c7c6ca5-m [2024-11-08 20:03:30,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:03:30,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:03:30,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:03:30,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:03:30,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:03:30,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:03:30,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:03:30,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:03:30,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:03:30,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:03:30,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:03:30,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:03:30,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:03:30,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:03:30,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:03:30,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:03:30,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:03:30,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:03:30,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:03:30,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:03:30,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:03:30,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:03:30,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:03:30,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:03:30,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:03:30,150 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:03:30,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:03:30,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:03:30,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:03:30,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:03:30,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:03:30,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:03:30,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:03:30,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:03:30,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:03:30,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:03:30,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:03:30,154 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:03:30,154 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:03:30,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:03:30,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:03:30,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:03:30,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:03:30,156 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-08 20:03:30,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:03:30,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:03:30,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:03:30,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:03:30,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:03:30,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 20:03:32,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:03:32,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:03:32,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 20:03:32,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101a3ca77/d334c87a3f7b4b29a16d5bbbe1b74b32/FLAG592bf1ba4 [2024-11-08 20:03:32,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101a3ca77/d334c87a3f7b4b29a16d5bbbe1b74b32 [2024-11-08 20:03:32,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:03:32,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:03:32,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:03:32,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:03:32,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:03:32,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e81f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32, skipping insertion in model container [2024-11-08 20:03:32,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:03:32,586 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-08 20:03:32,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:03:32,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:03:32,696 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-08 20:03:32,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:03:32,760 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:03:32,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32 WrapperNode [2024-11-08 20:03:32,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:03:32,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:03:32,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:03:32,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:03:32,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,810 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-08 20:03:32,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:03:32,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:03:32,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:03:32,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:03:32,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,843 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-08 20:03:32,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:03:32,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:03:32,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:03:32,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:03:32,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (1/1) ... [2024-11-08 20:03:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:03:32,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:03:32,906 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-08 20:03:32,908 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-08 20:03:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:03:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:03:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:03:32,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:03:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:03:32,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:03:33,031 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:03:33,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:03:33,529 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 20:03:33,529 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:03:33,545 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:03:33,545 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:03:33,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:03:33 BoogieIcfgContainer [2024-11-08 20:03:33,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:03:33,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:03:33,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:03:33,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:03:33,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:03:32" (1/3) ... [2024-11-08 20:03:33,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633f645b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:03:33, skipping insertion in model container [2024-11-08 20:03:33,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:03:32" (2/3) ... [2024-11-08 20:03:33,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633f645b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:03:33, skipping insertion in model container [2024-11-08 20:03:33,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:03:33" (3/3) ... [2024-11-08 20:03:33,556 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-84.i [2024-11-08 20:03:33,574 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:03:33,574 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:03:33,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:03:33,659 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;@2b8a9d7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:03:33,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:03:33,664 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-08 20:03:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 20:03:33,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:33,680 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-08 20:03:33,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:33,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2103567624, now seen corresponding path program 1 times [2024-11-08 20:03:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:03:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303584584] [2024-11-08 20:03:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:33,710 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-08 20:03:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:03:33,714 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-08 20:03:33,715 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-08 20:03:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:34,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:03:34,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:03:34,105 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-08 20:03:34,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:03:34,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:03:34,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303584584] [2024-11-08 20:03:34,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303584584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:34,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:34,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:03:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230597094] [2024-11-08 20:03:34,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:34,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:03:34,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:03:34,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:03:34,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:03:34,142 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-08 20:03:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:34,176 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-08 20:03:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:03:34,179 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-08 20:03:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:34,188 INFO L225 Difference]: With dead ends: 119 [2024-11-08 20:03:34,188 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 20:03:34,192 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-08 20:03:34,196 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-08 20:03:34,198 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-08 20:03:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 20:03:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 20:03:34,245 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-08 20:03:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-08 20:03:34,250 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 139 [2024-11-08 20:03:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:34,251 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-08 20:03:34,251 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-08 20:03:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-08 20:03:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 20:03:34,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:34,257 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-08 20:03:34,274 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-08 20:03:34,466 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-08 20:03:34,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:34,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash -176932552, now seen corresponding path program 1 times [2024-11-08 20:03:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:03:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067371286] [2024-11-08 20:03:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:34,471 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-08 20:03:34,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:03:34,475 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-08 20:03:34,477 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-08 20:03:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:34,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:03:34,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:03:34,729 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-08 20:03:34,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:03:34,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:03:34,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067371286] [2024-11-08 20:03:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067371286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:03:34,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:03:34,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:03:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508622900] [2024-11-08 20:03:34,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:03:34,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:03:34,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:03:34,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:03:34,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:03:34,734 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-08 20:03:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:03:34,793 INFO L93 Difference]: Finished difference Result 115 states and 173 transitions. [2024-11-08 20:03:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:03:34,801 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-08 20:03:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:03:34,803 INFO L225 Difference]: With dead ends: 115 [2024-11-08 20:03:34,804 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 20:03:34,804 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-08 20:03:34,805 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:03:34,806 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.0s Time] [2024-11-08 20:03:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 20:03:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 20:03:34,816 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-08 20:03:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-08 20:03:34,821 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 139 [2024-11-08 20:03:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:03:34,823 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-08 20:03:34,823 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-08 20:03:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-08 20:03:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 20:03:34,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:03:34,828 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-08 20:03:34,838 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-08 20:03:35,028 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-08 20:03:35,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:03:35,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:03:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -986279178, now seen corresponding path program 1 times [2024-11-08 20:03:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:03:35,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615011965] [2024-11-08 20:03:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:03:35,030 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-08 20:03:35,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:03:35,034 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-08 20:03:35,040 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-08 20:03:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:03:35,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 20:03:35,239 INFO L278 TraceCheckSpWp]: Computing forward predicates...