./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_fillercodestructure_normal_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:33:05,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:33:05,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:33:05,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:33:05,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:33:05,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:33:05,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:33:05,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:33:05,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:33:05,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:33:05,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:33:05,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:33:05,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:33:05,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:33:05,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:33:05,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:33:05,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:33:05,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:33:05,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:33:05,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:33:05,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:33:05,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:33:05,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:33:05,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:33:05,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:33:05,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:33:05,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:33:05,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:33:05,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:33:05,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:33:05,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:33:05,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:33:05,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:33:05,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:33:05,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:33:05,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:33:05,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:33:05,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:33:05,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:33:05,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:33:05,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:33:05,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:33:05,204 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 -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d [2024-11-12 04:33:05,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:33:05,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:33:05,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:33:05,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:33:05,438 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:33:05,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-12 04:33:06,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:33:07,027 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:33:07,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-12 04:33:07,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e31c4229/5dd8d13ae278428c97e0702cb2770543/FLAG1cd53cbf3 [2024-11-12 04:33:07,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e31c4229/5dd8d13ae278428c97e0702cb2770543 [2024-11-12 04:33:07,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:33:07,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:33:07,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:33:07,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:33:07,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:33:07,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183a88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07, skipping insertion in model container [2024-11-12 04:33:07,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:33:07,263 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_fillercodestructure_normal_file-9.i[912,925] [2024-11-12 04:33:07,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:33:07,321 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:33:07,363 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_fillercodestructure_normal_file-9.i[912,925] [2024-11-12 04:33:07,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:33:07,434 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:33:07,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07 WrapperNode [2024-11-12 04:33:07,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:33:07,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:33:07,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:33:07,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:33:07,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,523 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-12 04:33:07,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:33:07,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:33:07,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:33:07,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:33:07,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,571 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-12 04:33:07,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:33:07,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:33:07,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:33:07,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:33:07,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (1/1) ... [2024-11-12 04:33:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:33:07,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:07,653 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-12 04:33:07,659 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-12 04:33:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:33:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:33:07,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:33:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:33:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:33:07,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:33:07,796 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:33:07,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:33:08,161 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-12 04:33:08,161 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:33:08,171 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:33:08,172 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:33:08,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:08 BoogieIcfgContainer [2024-11-12 04:33:08,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:33:08,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:33:08,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:33:08,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:33:08,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:33:07" (1/3) ... [2024-11-12 04:33:08,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abe91d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:33:08, skipping insertion in model container [2024-11-12 04:33:08,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:07" (2/3) ... [2024-11-12 04:33:08,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abe91d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:33:08, skipping insertion in model container [2024-11-12 04:33:08,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:08" (3/3) ... [2024-11-12 04:33:08,180 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-12 04:33:08,195 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:33:08,196 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:33:08,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:33:08,262 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;@6cd5e0ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:33:08,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:33:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 04:33:08,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:08,281 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:08,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:08,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash 255444505, now seen corresponding path program 1 times [2024-11-12 04:33:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:08,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499710723] [2024-11-12 04:33:08,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:08,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:08,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499710723] [2024-11-12 04:33:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499710723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:33:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048007779] [2024-11-12 04:33:08,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:08,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:33:08,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:08,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:33:08,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:33:08,595 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 04:33:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:08,618 INFO L93 Difference]: Finished difference Result 141 states and 227 transitions. [2024-11-12 04:33:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:33:08,621 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-12 04:33:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:08,626 INFO L225 Difference]: With dead ends: 141 [2024-11-12 04:33:08,627 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 04:33:08,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:33:08,636 INFO L435 NwaCegarLoop]: 102 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, 102 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-12 04:33:08,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:33:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 04:33:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 04:33:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-12 04:33:08,723 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 108 [2024-11-12 04:33:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:08,723 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-12 04:33:08,724 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 04:33:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-11-12 04:33:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 04:33:08,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:08,737 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:08,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:33:08,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -878433837, now seen corresponding path program 1 times [2024-11-12 04:33:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:08,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609953785] [2024-11-12 04:33:08,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:08,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609953785] [2024-11-12 04:33:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609953785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:09,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:09,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:33:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011029150] [2024-11-12 04:33:09,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:09,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:33:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:33:09,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:33:09,003 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:09,022 INFO L93 Difference]: Finished difference Result 138 states and 203 transitions. [2024-11-12 04:33:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:33:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-12 04:33:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:09,024 INFO L225 Difference]: With dead ends: 138 [2024-11-12 04:33:09,024 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 04:33:09,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:33:09,025 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:09,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:33:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 04:33:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-12 04:33:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-12 04:33:09,034 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2024-11-12 04:33:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:09,036 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-12 04:33:09,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-12 04:33:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:33:09,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:09,038 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:09,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:33:09,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:09,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1398780630, now seen corresponding path program 1 times [2024-11-12 04:33:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:09,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092772027] [2024-11-12 04:33:09,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092772027] [2024-11-12 04:33:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092772027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 04:33:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017773491] [2024-11-12 04:33:12,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:12,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:33:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:12,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:33:12,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:33:12,410 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 04:33:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:14,642 INFO L93 Difference]: Finished difference Result 249 states and 360 transitions. [2024-11-12 04:33:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:33:14,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-11-12 04:33:14,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:14,651 INFO L225 Difference]: With dead ends: 249 [2024-11-12 04:33:14,651 INFO L226 Difference]: Without dead ends: 181 [2024-11-12 04:33:14,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-12 04:33:14,653 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 594 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:14,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 301 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 04:33:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-12 04:33:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 97. [2024-11-12 04:33:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-12 04:33:14,673 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-12 04:33:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:14,674 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-12 04:33:14,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 04:33:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-12 04:33:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:33:14,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:14,675 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:14,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:33:14,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1875118312, now seen corresponding path program 1 times [2024-11-12 04:33:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:14,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780612518] [2024-11-12 04:33:14,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:14,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:17,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780612518] [2024-11-12 04:33:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780612518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:17,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:17,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 04:33:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98803470] [2024-11-12 04:33:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:17,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:33:17,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:17,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:33:17,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:33:17,135 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:18,173 INFO L93 Difference]: Finished difference Result 262 states and 384 transitions. [2024-11-12 04:33:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:33:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-12 04:33:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:18,176 INFO L225 Difference]: With dead ends: 262 [2024-11-12 04:33:18,177 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 04:33:18,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:33:18,179 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 134 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:18,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 358 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 04:33:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 04:33:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 97. [2024-11-12 04:33:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-12 04:33:18,197 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-12 04:33:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:18,197 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-12 04:33:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-12 04:33:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:33:18,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:18,202 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:18,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:33:18,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:18,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1207242924, now seen corresponding path program 1 times [2024-11-12 04:33:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139444536] [2024-11-12 04:33:18,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:18,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139444536] [2024-11-12 04:33:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139444536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:20,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:20,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 04:33:20,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872485209] [2024-11-12 04:33:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:33:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:20,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:33:20,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:33:20,362 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 04:33:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:22,653 INFO L93 Difference]: Finished difference Result 277 states and 402 transitions. [2024-11-12 04:33:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:33:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-11-12 04:33:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:22,655 INFO L225 Difference]: With dead ends: 277 [2024-11-12 04:33:22,655 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 04:33:22,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-12 04:33:22,662 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 438 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:22,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 366 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 04:33:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 04:33:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 102. [2024-11-12 04:33:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2024-11-12 04:33:22,678 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 109 [2024-11-12 04:33:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:22,679 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2024-11-12 04:33:22,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 04:33:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-11-12 04:33:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:33:22,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:22,680 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:22,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:33:22,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash 186174570, now seen corresponding path program 1 times [2024-11-12 04:33:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689901891] [2024-11-12 04:33:22,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:24,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:24,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689901891] [2024-11-12 04:33:24,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689901891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:24,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:24,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 04:33:24,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870511066] [2024-11-12 04:33:24,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:24,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:33:24,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:24,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:33:24,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:33:24,367 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:25,094 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2024-11-12 04:33:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:33:25,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-12 04:33:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:25,096 INFO L225 Difference]: With dead ends: 269 [2024-11-12 04:33:25,097 INFO L226 Difference]: Without dead ends: 170 [2024-11-12 04:33:25,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:33:25,098 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:25,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 452 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 04:33:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-12 04:33:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 97. [2024-11-12 04:33:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-12 04:33:25,118 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-12 04:33:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:25,119 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-12 04:33:25,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-12 04:33:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:33:25,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:25,120 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:25,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:33:25,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:25,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash -976078804, now seen corresponding path program 1 times [2024-11-12 04:33:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616228965] [2024-11-12 04:33:25,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:26,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616228965] [2024-11-12 04:33:26,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616228965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:26,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 04:33:26,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642636253] [2024-11-12 04:33:26,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:26,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:33:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:26,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:33:26,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:33:26,195 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:26,546 INFO L93 Difference]: Finished difference Result 255 states and 377 transitions. [2024-11-12 04:33:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:33:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-12 04:33:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:26,549 INFO L225 Difference]: With dead ends: 255 [2024-11-12 04:33:26,549 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 04:33:26,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:33:26,550 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 125 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:26,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 270 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:33:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 04:33:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 97. [2024-11-12 04:33:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-12 04:33:26,562 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-12 04:33:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:26,563 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-12 04:33:26,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-12 04:33:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 04:33:26,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:26,564 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:26,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:33:26,565 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:26,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1629944750, now seen corresponding path program 1 times [2024-11-12 04:33:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181236558] [2024-11-12 04:33:26,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:27,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:27,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181236558] [2024-11-12 04:33:27,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181236558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:27,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:27,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 04:33:27,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342684512] [2024-11-12 04:33:27,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:27,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:33:27,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:27,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:33:27,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:33:27,661 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:28,737 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2024-11-12 04:33:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:33:28,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-12 04:33:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:28,738 INFO L225 Difference]: With dead ends: 233 [2024-11-12 04:33:28,738 INFO L226 Difference]: Without dead ends: 139 [2024-11-12 04:33:28,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:33:28,739 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 134 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:28,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 426 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 04:33:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-12 04:33:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 73. [2024-11-12 04:33:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2024-11-12 04:33:28,744 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 109 [2024-11-12 04:33:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:28,745 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2024-11-12 04:33:28,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2024-11-12 04:33:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 04:33:28,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:28,746 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:28,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:33:28,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash -451875899, now seen corresponding path program 1 times [2024-11-12 04:33:28,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:28,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646624456] [2024-11-12 04:33:28,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 04:33:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:28,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646624456] [2024-11-12 04:33:28,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646624456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:33:28,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788315991] [2024-11-12 04:33:28,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:28,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:28,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:28,941 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-12 04:33:28,942 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-12 04:33:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:29,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 04:33:29,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:33:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-12 04:33:29,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:33:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 04:33:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788315991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:33:29,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:33:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-12 04:33:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343444753] [2024-11-12 04:33:29,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:33:29,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:33:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:29,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:33:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:33:29,537 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-12 04:33:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:29,708 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2024-11-12 04:33:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 04:33:29,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 111 [2024-11-12 04:33:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:29,710 INFO L225 Difference]: With dead ends: 153 [2024-11-12 04:33:29,710 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 04:33:29,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-12 04:33:29,713 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 213 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:29,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 172 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:33:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 04:33:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-12 04:33:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-11-12 04:33:29,725 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 111 [2024-11-12 04:33:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:29,726 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-11-12 04:33:29,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-12 04:33:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-11-12 04:33:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 04:33:29,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:29,727 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:29,749 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-12 04:33:29,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:29,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:29,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1848946691, now seen corresponding path program 1 times [2024-11-12 04:33:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:29,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273569318] [2024-11-12 04:33:29,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:33:29,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9946002] [2024-11-12 04:33:29,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:29,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:29,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:29,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:33:29,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 04:33:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:30,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 04:33:30,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:33:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-12 04:33:30,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:33:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 04:33:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273569318] [2024-11-12 04:33:30,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 04:33:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9946002] [2024-11-12 04:33:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9946002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:33:30,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:33:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-12 04:33:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313951241] [2024-11-12 04:33:30,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:33:30,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 04:33:30,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 04:33:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-12 04:33:30,801 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-12 04:33:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:31,563 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions. [2024-11-12 04:33:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 04:33:31,563 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2024-11-12 04:33:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:31,565 INFO L225 Difference]: With dead ends: 251 [2024-11-12 04:33:31,565 INFO L226 Difference]: Without dead ends: 173 [2024-11-12 04:33:31,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-12 04:33:31,566 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 228 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:31,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 829 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 04:33:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-12 04:33:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 120. [2024-11-12 04:33:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2024-11-12 04:33:31,575 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 111 [2024-11-12 04:33:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:31,576 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2024-11-12 04:33:31,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-12 04:33:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2024-11-12 04:33:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 04:33:31,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:31,577 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:31,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 04:33:31,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 04:33:31,782 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:31,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1417968666, now seen corresponding path program 1 times [2024-11-12 04:33:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:31,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782113099] [2024-11-12 04:33:31,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:31,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782113099] [2024-11-12 04:33:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782113099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:33:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969519058] [2024-11-12 04:33:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:31,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:33:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:33:31,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:33:31,857 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:31,895 INFO L93 Difference]: Finished difference Result 288 states and 385 transitions. [2024-11-12 04:33:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:33:31,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-12 04:33:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:31,898 INFO L225 Difference]: With dead ends: 288 [2024-11-12 04:33:31,898 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 04:33:31,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:33:31,899 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:31,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 192 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:33:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 04:33:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 120. [2024-11-12 04:33:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2024-11-12 04:33:31,910 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 111 [2024-11-12 04:33:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:31,910 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2024-11-12 04:33:31,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2024-11-12 04:33:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 04:33:31,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:31,911 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:31,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 04:33:31,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:31,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1719733946, now seen corresponding path program 1 times [2024-11-12 04:33:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465687248] [2024-11-12 04:33:31,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:32,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465687248] [2024-11-12 04:33:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465687248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 04:33:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593156146] [2024-11-12 04:33:32,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:32,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:33:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:33:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:33:32,494 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:33,002 INFO L93 Difference]: Finished difference Result 479 states and 631 transitions. [2024-11-12 04:33:33,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:33:33,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-12 04:33:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:33,005 INFO L225 Difference]: With dead ends: 479 [2024-11-12 04:33:33,005 INFO L226 Difference]: Without dead ends: 362 [2024-11-12 04:33:33,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:33:33,006 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 191 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:33,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 471 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 04:33:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-12 04:33:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 239. [2024-11-12 04:33:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.3235294117647058) internal successors, (270), 205 states have internal predecessors, (270), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:33:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 322 transitions. [2024-11-12 04:33:33,025 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 322 transitions. Word has length 111 [2024-11-12 04:33:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:33,026 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 322 transitions. [2024-11-12 04:33:33,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 322 transitions. [2024-11-12 04:33:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 04:33:33,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:33,028 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:33,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 04:33:33,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:33,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2142435772, now seen corresponding path program 1 times [2024-11-12 04:33:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278797685] [2024-11-12 04:33:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:33,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278797685] [2024-11-12 04:33:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278797685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:33,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:33,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:33:33,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647212417] [2024-11-12 04:33:33,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:33,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:33:33,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:33:33,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:33:33,288 INFO L87 Difference]: Start difference. First operand 239 states and 322 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:33,613 INFO L93 Difference]: Finished difference Result 695 states and 916 transitions. [2024-11-12 04:33:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:33:33,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-12 04:33:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:33,619 INFO L225 Difference]: With dead ends: 695 [2024-11-12 04:33:33,620 INFO L226 Difference]: Without dead ends: 459 [2024-11-12 04:33:33,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:33:33,621 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 139 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:33,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 546 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:33:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-12 04:33:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 246. [2024-11-12 04:33:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 212 states have internal predecessors, (280), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:33:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 332 transitions. [2024-11-12 04:33:33,644 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 332 transitions. Word has length 111 [2024-11-12 04:33:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:33,645 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 332 transitions. [2024-11-12 04:33:33,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 332 transitions. [2024-11-12 04:33:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 04:33:33,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:33,648 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:33,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 04:33:33,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:33,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1485993431, now seen corresponding path program 1 times [2024-11-12 04:33:33,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:33,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319999129] [2024-11-12 04:33:33,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:36,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:36,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319999129] [2024-11-12 04:33:36,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319999129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:36,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:36,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 04:33:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964728815] [2024-11-12 04:33:36,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 04:33:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 04:33:36,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-12 04:33:36,277 INFO L87 Difference]: Start difference. First operand 246 states and 332 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:40,310 INFO L93 Difference]: Finished difference Result 562 states and 749 transitions. [2024-11-12 04:33:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 04:33:40,310 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-12 04:33:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:40,312 INFO L225 Difference]: With dead ends: 562 [2024-11-12 04:33:40,312 INFO L226 Difference]: Without dead ends: 319 [2024-11-12 04:33:40,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-12 04:33:40,313 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 381 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:40,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 758 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 04:33:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-12 04:33:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 276. [2024-11-12 04:33:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.3319502074688796) internal successors, (321), 242 states have internal predecessors, (321), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:33:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 373 transitions. [2024-11-12 04:33:40,327 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 373 transitions. Word has length 112 [2024-11-12 04:33:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:40,327 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 373 transitions. [2024-11-12 04:33:40,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 373 transitions. [2024-11-12 04:33:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 04:33:40,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:40,329 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:40,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 04:33:40,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:40,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:40,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1787758711, now seen corresponding path program 1 times [2024-11-12 04:33:40,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:40,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678988530] [2024-11-12 04:33:40,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:33:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:33:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:33:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:33:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:33:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:33:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:33:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:33:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678988530] [2024-11-12 04:33:40,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678988530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:40,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:40,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:33:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544637205] [2024-11-12 04:33:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:40,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:33:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:33:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:33:40,535 INFO L87 Difference]: Start difference. First operand 276 states and 373 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:40,891 INFO L93 Difference]: Finished difference Result 813 states and 1094 transitions. [2024-11-12 04:33:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:33:40,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-12 04:33:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:40,896 INFO L225 Difference]: With dead ends: 813 [2024-11-12 04:33:40,896 INFO L226 Difference]: Without dead ends: 540 [2024-11-12 04:33:40,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:33:40,898 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 111 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:40,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 638 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:33:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-12 04:33:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 448. [2024-11-12 04:33:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 379 states have (on average 1.2955145118733509) internal successors, (491), 381 states have internal predecessors, (491), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 04:33:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 595 transitions. [2024-11-12 04:33:40,932 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 595 transitions. Word has length 112 [2024-11-12 04:33:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:40,932 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 595 transitions. [2024-11-12 04:33:40,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 595 transitions. [2024-11-12 04:33:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 04:33:40,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:40,933 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:40,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 04:33:40,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1573618992, now seen corresponding path program 1 times [2024-11-12 04:33:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66190584] [2024-11-12 04:33:40,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:33:40,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824861734] [2024-11-12 04:33:40,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:40,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:40,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:40,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:33:40,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 04:33:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:33:41,762 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:33:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:33:41,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:33:41,891 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:33:41,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:33:41,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 04:33:42,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:42,101 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:42,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:33:42,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:33:42 BoogieIcfgContainer [2024-11-12 04:33:42,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:33:42,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:33:42,172 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:33:42,172 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:33:42,172 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:08" (3/4) ... [2024-11-12 04:33:42,174 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:33:42,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:33:42,177 INFO L158 Benchmark]: Toolchain (without parser) took 35112.60ms. Allocated memory was 146.8MB in the beginning and 482.3MB in the end (delta: 335.5MB). Free memory was 75.3MB in the beginning and 174.2MB in the end (delta: -98.9MB). Peak memory consumption was 236.8MB. Max. memory is 16.1GB. [2024-11-12 04:33:42,177 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:33:42,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.89ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 75.1MB in the beginning and 202.5MB in the end (delta: -127.4MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-12 04:33:42,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.47ms. Allocated memory is still 230.7MB. Free memory was 202.5MB in the beginning and 199.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:33:42,178 INFO L158 Benchmark]: Boogie Preprocessor took 63.18ms. Allocated memory is still 230.7MB. Free memory was 199.4MB in the beginning and 196.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:33:42,178 INFO L158 Benchmark]: RCFGBuilder took 580.64ms. Allocated memory is still 230.7MB. Free memory was 196.2MB in the beginning and 173.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 04:33:42,178 INFO L158 Benchmark]: TraceAbstraction took 33997.37ms. Allocated memory was 230.7MB in the beginning and 482.3MB in the end (delta: 251.7MB). Free memory was 172.1MB in the beginning and 174.2MB in the end (delta: -2.1MB). Peak memory consumption was 249.5MB. Max. memory is 16.1GB. [2024-11-12 04:33:42,178 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 482.3MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:33:42,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.89ms. Allocated memory was 146.8MB in the beginning and 230.7MB in the end (delta: 83.9MB). Free memory was 75.1MB in the beginning and 202.5MB in the end (delta: -127.4MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.47ms. Allocated memory is still 230.7MB. Free memory was 202.5MB in the beginning and 199.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.18ms. Allocated memory is still 230.7MB. Free memory was 199.4MB in the beginning and 196.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 580.64ms. Allocated memory is still 230.7MB. Free memory was 196.2MB in the beginning and 173.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 33997.37ms. Allocated memory was 230.7MB in the beginning and 482.3MB in the end (delta: 251.7MB). Free memory was 172.1MB in the beginning and 174.2MB in the end (delta: -2.1MB). Peak memory consumption was 249.5MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 482.3MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 16, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2869 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2863 mSDsluCounter, 6078 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4488 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4526 IncrementalHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1590 mSDtfsCounter, 4526 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1046 GetRequests, 903 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=15, InterpolantAutomatonStates: 126, 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, 15 MinimizatonAttempts, 1016 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 2095 NumberOfCodeBlocks, 2095 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1964 ConstructedInterpolants, 0 QuantifiedInterpolants, 10485 SizeOfPredicates, 9 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 7374/7560 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-12 04:33:42,281 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_fillercodestructure_normal_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:33:44,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:33:44,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:33:44,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:33:44,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:33:44,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:33:44,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:33:44,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:33:44,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:33:44,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:33:44,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:33:44,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:33:44,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:33:44,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:33:44,788 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:33:44,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:33:44,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:33:44,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:33:44,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:33:44,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:33:44,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:33:44,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:33:44,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:33:44,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:33:44,796 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:33:44,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:33:44,796 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:33:44,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:33:44,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:33:44,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:33:44,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:33:44,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:33:44,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:33:44,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:33:44,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:33:44,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:33:44,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:33:44,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:33:44,805 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:33:44,805 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:33:44,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:33:44,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:33:44,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:33:44,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:33:44,806 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 -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d [2024-11-12 04:33:45,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:33:45,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:33:45,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:33:45,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:33:45,140 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:33:45,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-12 04:33:46,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:33:46,918 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:33:46,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-12 04:33:46,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf0005bc/33b9bb8fbd45482ebc1cb33aa9ddc9ef/FLAG823f34fa3 [2024-11-12 04:33:47,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf0005bc/33b9bb8fbd45482ebc1cb33aa9ddc9ef [2024-11-12 04:33:47,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:33:47,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:33:47,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:33:47,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:33:47,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:33:47,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127c708f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47, skipping insertion in model container [2024-11-12 04:33:47,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:33:47,442 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_fillercodestructure_normal_file-9.i[912,925] [2024-11-12 04:33:47,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:33:47,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:33:47,550 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_fillercodestructure_normal_file-9.i[912,925] [2024-11-12 04:33:47,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:33:47,606 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:33:47,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47 WrapperNode [2024-11-12 04:33:47,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:33:47,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:33:47,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:33:47,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:33:47,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,657 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-12 04:33:47,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:33:47,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:33:47,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:33:47,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:33:47,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,689 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-12 04:33:47,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:33:47,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:33:47,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:33:47,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:33:47,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (1/1) ... [2024-11-12 04:33:47,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:33:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:47,765 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-12 04:33:47,774 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-12 04:33:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:33:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:33:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:33:47,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:33:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:33:47,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:33:47,941 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:33:47,945 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:33:48,282 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 04:33:48,283 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:33:48,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:33:48,295 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:33:48,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:48 BoogieIcfgContainer [2024-11-12 04:33:48,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:33:48,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:33:48,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:33:48,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:33:48,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:33:47" (1/3) ... [2024-11-12 04:33:48,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a710a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:33:48, skipping insertion in model container [2024-11-12 04:33:48,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:47" (2/3) ... [2024-11-12 04:33:48,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a710a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:33:48, skipping insertion in model container [2024-11-12 04:33:48,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:48" (3/3) ... [2024-11-12 04:33:48,306 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-9.i [2024-11-12 04:33:48,322 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:33:48,322 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:33:48,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:33:48,385 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;@564177db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:33:48,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:33:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 04:33:48,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:48,396 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:48,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:48,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1232252901, now seen corresponding path program 1 times [2024-11-12 04:33:48,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:33:48,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612086148] [2024-11-12 04:33:48,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:48,410 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-12 04:33:48,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:33:48,413 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-12 04:33:48,414 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-12 04:33:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:48,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:33:48,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:33:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 04:33:48,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:33:48,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:33:48,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612086148] [2024-11-12 04:33:48,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612086148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:48,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:48,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:33:48,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843984691] [2024-11-12 04:33:48,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:48,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:33:48,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:33:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:33:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:33:48,749 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:48,774 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-12 04:33:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:33:48,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-12 04:33:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:48,785 INFO L225 Difference]: With dead ends: 103 [2024-11-12 04:33:48,785 INFO L226 Difference]: Without dead ends: 51 [2024-11-12 04:33:48,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-12 04:33:48,795 INFO L435 NwaCegarLoop]: 74 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, 74 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-12 04:33:48,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:33:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-12 04:33:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-12 04:33:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:33:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-12 04:33:48,843 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 100 [2024-11-12 04:33:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:48,846 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-12 04:33:48,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 04:33:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-12 04:33:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 04:33:48,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:48,852 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:33:48,871 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-12 04:33:49,056 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-12 04:33:49,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:49,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1657719433, now seen corresponding path program 1 times [2024-11-12 04:33:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:33:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7768549] [2024-11-12 04:33:49,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:49,061 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-12 04:33:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:33:49,064 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-12 04:33:49,067 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-12 04:33:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:49,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 04:33:49,260 INFO L279 TraceCheckSpWp]: Computing forward predicates...