./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.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 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:50:14,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:50:15,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:50:15,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:50:15,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:50:15,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:50:15,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:50:15,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:50:15,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:50:15,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:50:15,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:50:15,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:50:15,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:50:15,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:50:15,060 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:50:15,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:50:15,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:50:15,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:50:15,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:50:15,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:50:15,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:50:15,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:50:15,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:50:15,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:50:15,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:50:15,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:50:15,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:50:15,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:50:15,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:50:15,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:50:15,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:50:15,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:50:15,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:50:15,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:50:15,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:50:15,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:50:15,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:50:15,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:50:15,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:50:15,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:50:15,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:50:15,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:50:15,074 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 -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd [2024-10-13 05:50:15,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:50:15,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:50:15,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:50:15,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:50:15,345 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:50:15,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-10-13 05:50:16,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:50:17,021 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:50:17,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-10-13 05:50:17,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9105c14/9f66bfc03ead414f9f0a3ae91eeef408/FLAG2d4d891f0 [2024-10-13 05:50:17,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9105c14/9f66bfc03ead414f9f0a3ae91eeef408 [2024-10-13 05:50:17,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:50:17,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:50:17,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:50:17,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:50:17,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:50:17,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b5fc43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17, skipping insertion in model container [2024-10-13 05:50:17,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:50:17,304 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926] [2024-10-13 05:50:17,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:50:17,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:50:17,403 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926] [2024-10-13 05:50:17,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:50:17,461 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:50:17,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17 WrapperNode [2024-10-13 05:50:17,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:50:17,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:50:17,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:50:17,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:50:17,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,526 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-10-13 05:50:17,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:50:17,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:50:17,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:50:17,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:50:17,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,573 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:50:17,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:50:17,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:50:17,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:50:17,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:50:17,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (1/1) ... [2024-10-13 05:50:17,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:50:17,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:50:17,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:50:17,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:50:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:50:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:50:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:50:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:50:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:50:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:50:17,764 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:50:17,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:50:18,048 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 05:50:18,049 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:50:18,094 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:50:18,095 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:50:18,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:18 BoogieIcfgContainer [2024-10-13 05:50:18,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:50:18,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:50:18,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:50:18,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:50:18,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:50:17" (1/3) ... [2024-10-13 05:50:18,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaaca90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:50:18, skipping insertion in model container [2024-10-13 05:50:18,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:17" (2/3) ... [2024-10-13 05:50:18,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaaca90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:50:18, skipping insertion in model container [2024-10-13 05:50:18,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:18" (3/3) ... [2024-10-13 05:50:18,103 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2024-10-13 05:50:18,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:50:18,118 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:50:18,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:50:18,180 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;@2f7fff4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:50:18,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:50:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:50:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 05:50:18,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:18,198 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:18,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:18,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash 593086923, now seen corresponding path program 1 times [2024-10-13 05:50:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773519643] [2024-10-13 05:50:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:18,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773519643] [2024-10-13 05:50:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773519643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:50:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354991202] [2024-10-13 05:50:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:18,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:50:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:18,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:50:18,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:50:18,662 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:50:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:18,710 INFO L93 Difference]: Finished difference Result 105 states and 168 transitions. [2024-10-13 05:50:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:50:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-10-13 05:50:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:18,720 INFO L225 Difference]: With dead ends: 105 [2024-10-13 05:50:18,720 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 05:50:18,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:50:18,730 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:18,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:50:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 05:50:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 05:50:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:50:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-10-13 05:50:18,782 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 83 [2024-10-13 05:50:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:18,782 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-13 05:50:18,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:50:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-10-13 05:50:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 05:50:18,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:18,787 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:18,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:50:18,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:18,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1413809453, now seen corresponding path program 1 times [2024-10-13 05:50:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941464332] [2024-10-13 05:50:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:18,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:19,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941464332] [2024-10-13 05:50:19,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941464332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:19,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:19,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:50:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83836546] [2024-10-13 05:50:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:19,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:50:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:50:19,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:19,167 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:19,235 INFO L93 Difference]: Finished difference Result 103 states and 147 transitions. [2024-10-13 05:50:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:50:19,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-13 05:50:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:19,238 INFO L225 Difference]: With dead ends: 103 [2024-10-13 05:50:19,238 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 05:50:19,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:19,240 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:19,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:50:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 05:50:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 05:50:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:50:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2024-10-13 05:50:19,255 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 83 [2024-10-13 05:50:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:19,256 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2024-10-13 05:50:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2024-10-13 05:50:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:50:19,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:19,262 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:19,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:50:19,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:19,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:19,263 INFO L85 PathProgramCache]: Analyzing trace with hash 382866458, now seen corresponding path program 1 times [2024-10-13 05:50:19,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:19,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966703478] [2024-10-13 05:50:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966703478] [2024-10-13 05:50:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966703478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:50:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171684823] [2024-10-13 05:50:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:20,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:50:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:50:20,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:50:20,154 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:20,491 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2024-10-13 05:50:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:50:20,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 05:50:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:20,499 INFO L225 Difference]: With dead ends: 175 [2024-10-13 05:50:20,499 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 05:50:20,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:50:20,501 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 118 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:20,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 230 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:50:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 05:50:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2024-10-13 05:50:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-10-13 05:50:20,534 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 85 [2024-10-13 05:50:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:20,534 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-10-13 05:50:20,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2024-10-13 05:50:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:50:20,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:20,539 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:20,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:50:20,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:20,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash -426480168, now seen corresponding path program 1 times [2024-10-13 05:50:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067944758] [2024-10-13 05:50:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:20,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:20,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067944758] [2024-10-13 05:50:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067944758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:20,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:20,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:50:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724285878] [2024-10-13 05:50:20,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:20,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:50:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:50:20,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:20,750 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:20,799 INFO L93 Difference]: Finished difference Result 177 states and 245 transitions. [2024-10-13 05:50:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:50:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 05:50:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:20,803 INFO L225 Difference]: With dead ends: 177 [2024-10-13 05:50:20,803 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 05:50:20,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:20,805 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:20,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:50:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 05:50:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 05:50:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-10-13 05:50:20,830 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 85 [2024-10-13 05:50:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:20,831 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-10-13 05:50:20,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-10-13 05:50:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:50:20,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:20,833 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:20,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:50:20,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -369221866, now seen corresponding path program 1 times [2024-10-13 05:50:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:20,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552122579] [2024-10-13 05:50:20,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:22,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:22,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552122579] [2024-10-13 05:50:22,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552122579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:50:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724744754] [2024-10-13 05:50:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:22,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:50:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:22,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:50:22,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:50:22,152 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:22,392 INFO L93 Difference]: Finished difference Result 200 states and 268 transitions. [2024-10-13 05:50:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:50:22,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 05:50:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:22,397 INFO L225 Difference]: With dead ends: 200 [2024-10-13 05:50:22,398 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 05:50:22,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:50:22,399 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:22,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 141 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:50:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 05:50:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2024-10-13 05:50:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 80 states have internal predecessors, (101), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2024-10-13 05:50:22,419 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 85 [2024-10-13 05:50:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:22,420 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2024-10-13 05:50:22,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2024-10-13 05:50:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:50:22,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:22,425 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:22,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:50:22,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:22,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash -570992490, now seen corresponding path program 1 times [2024-10-13 05:50:22,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:22,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196191617] [2024-10-13 05:50:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:22,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:27,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196191617] [2024-10-13 05:50:27,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196191617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:27,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:27,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:50:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109961248] [2024-10-13 05:50:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:50:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:50:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:50:27,409 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:29,000 INFO L93 Difference]: Finished difference Result 231 states and 306 transitions. [2024-10-13 05:50:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:50:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 05:50:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:29,003 INFO L225 Difference]: With dead ends: 231 [2024-10-13 05:50:29,005 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 05:50:29,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:50:29,007 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:29,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 377 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 05:50:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 05:50:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 98. [2024-10-13 05:50:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 82 states have internal predecessors, (104), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2024-10-13 05:50:29,029 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 85 [2024-10-13 05:50:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:29,030 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2024-10-13 05:50:29,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2024-10-13 05:50:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:50:29,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:29,031 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:29,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:50:29,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:29,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1380339116, now seen corresponding path program 1 times [2024-10-13 05:50:29,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:29,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438283609] [2024-10-13 05:50:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:29,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:29,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438283609] [2024-10-13 05:50:29,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438283609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:50:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398300466] [2024-10-13 05:50:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:29,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:50:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:29,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:50:29,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:50:29,985 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:30,195 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2024-10-13 05:50:30,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:50:30,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 05:50:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:30,198 INFO L225 Difference]: With dead ends: 212 [2024-10-13 05:50:30,199 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 05:50:30,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:50:30,201 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:30,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 216 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:50:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 05:50:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2024-10-13 05:50:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 73 states have internal predecessors, (92), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-10-13 05:50:30,213 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 85 [2024-10-13 05:50:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:30,213 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-10-13 05:50:30,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-10-13 05:50:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:50:30,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:30,215 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:30,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:50:30,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:30,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -839738918, now seen corresponding path program 1 times [2024-10-13 05:50:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471081478] [2024-10-13 05:50:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:30,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:30,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471081478] [2024-10-13 05:50:30,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471081478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:30,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:30,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:50:30,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023903239] [2024-10-13 05:50:30,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:30,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:50:30,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:30,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:50:30,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:30,276 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:30,302 INFO L93 Difference]: Finished difference Result 180 states and 241 transitions. [2024-10-13 05:50:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:50:30,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 05:50:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:30,304 INFO L225 Difference]: With dead ends: 180 [2024-10-13 05:50:30,304 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 05:50:30,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:30,306 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:30,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 155 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:50:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 05:50:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-10-13 05:50:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2024-10-13 05:50:30,315 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 85 [2024-10-13 05:50:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:30,315 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2024-10-13 05:50:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2024-10-13 05:50:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:50:30,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:30,317 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:30,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:50:30,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1850856168, now seen corresponding path program 1 times [2024-10-13 05:50:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025974172] [2024-10-13 05:50:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025974172] [2024-10-13 05:50:30,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025974172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:30,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:30,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:50:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119319909] [2024-10-13 05:50:30,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:30,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:50:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:30,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:50:30,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:50:30,456 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:30,488 INFO L93 Difference]: Finished difference Result 180 states and 239 transitions. [2024-10-13 05:50:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:50:30,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 05:50:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:30,491 INFO L225 Difference]: With dead ends: 180 [2024-10-13 05:50:30,491 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 05:50:30,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:50:30,492 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 22 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:30,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 248 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:50:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 05:50:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-10-13 05:50:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2024-10-13 05:50:30,505 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 85 [2024-10-13 05:50:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:30,507 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2024-10-13 05:50:30,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2024-10-13 05:50:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:50:30,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:30,509 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:30,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:50:30,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:30,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:30,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2053835718, now seen corresponding path program 1 times [2024-10-13 05:50:30,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:30,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064966184] [2024-10-13 05:50:30,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:30,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:30,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064966184] [2024-10-13 05:50:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064966184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:30,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:50:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056548008] [2024-10-13 05:50:30,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:30,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:50:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:50:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:30,574 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:30,614 INFO L93 Difference]: Finished difference Result 177 states and 235 transitions. [2024-10-13 05:50:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:50:30,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-10-13 05:50:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:30,616 INFO L225 Difference]: With dead ends: 177 [2024-10-13 05:50:30,616 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 05:50:30,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:30,617 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:30,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:50:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 05:50:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 05:50:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 73 states have internal predecessors, (88), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2024-10-13 05:50:30,625 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 88 [2024-10-13 05:50:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2024-10-13 05:50:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2024-10-13 05:50:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 05:50:30,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:30,627 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:50:30,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -433548531, now seen corresponding path program 1 times [2024-10-13 05:50:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296424381] [2024-10-13 05:50:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 05:50:30,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296424381] [2024-10-13 05:50:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296424381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:50:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619790246] [2024-10-13 05:50:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:30,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:50:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:50:30,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:50:30,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 05:50:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:30,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 05:50:30,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:50:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-13 05:50:31,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:50:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 05:50:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619790246] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:50:31,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:50:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-10-13 05:50:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252253810] [2024-10-13 05:50:31,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:50:31,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:50:31,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:31,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:50:31,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:50:31,479 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-13 05:50:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:32,229 INFO L93 Difference]: Finished difference Result 271 states and 341 transitions. [2024-10-13 05:50:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 05:50:32,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 90 [2024-10-13 05:50:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:32,231 INFO L225 Difference]: With dead ends: 271 [2024-10-13 05:50:32,231 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 05:50:32,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2024-10-13 05:50:32,232 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 169 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:32,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 184 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:50:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 05:50:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 108. [2024-10-13 05:50:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 91 states have internal predecessors, (105), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2024-10-13 05:50:32,247 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 90 [2024-10-13 05:50:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:32,248 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2024-10-13 05:50:32,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-13 05:50:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2024-10-13 05:50:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 05:50:32,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:32,250 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:32,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 05:50:32,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 05:50:32,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1535686259, now seen corresponding path program 1 times [2024-10-13 05:50:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940112100] [2024-10-13 05:50:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:50:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:50:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:50:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:50:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:50:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:50:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:50:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:50:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:50:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:50:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:50:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:50:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 05:50:33,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:50:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940112100] [2024-10-13 05:50:33,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940112100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:50:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074674652] [2024-10-13 05:50:33,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:33,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:50:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:50:33,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:50:33,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 05:50:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:33,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 05:50:33,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:50:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-13 05:50:33,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:50:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 05:50:33,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074674652] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:50:33,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:50:33,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2024-10-13 05:50:33,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652809521] [2024-10-13 05:50:33,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:50:33,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 05:50:33,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:50:33,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 05:50:33,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-10-13 05:50:33,560 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-13 05:50:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:34,415 INFO L93 Difference]: Finished difference Result 227 states and 275 transitions. [2024-10-13 05:50:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 05:50:34,415 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 90 [2024-10-13 05:50:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:34,416 INFO L225 Difference]: With dead ends: 227 [2024-10-13 05:50:34,417 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 05:50:34,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=284, Invalid=1122, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 05:50:34,418 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 219 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:34,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 195 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:50:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 05:50:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2024-10-13 05:50:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.118279569892473) internal successors, (104), 94 states have internal predecessors, (104), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2024-10-13 05:50:34,431 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 90 [2024-10-13 05:50:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:34,432 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2024-10-13 05:50:34,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-13 05:50:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2024-10-13 05:50:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 05:50:34,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:34,434 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:34,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 05:50:34,634 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,SelfDestructingSolverStorable11 [2024-10-13 05:50:34,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:34,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2122492273, now seen corresponding path program 1 times [2024-10-13 05:50:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:50:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429148903] [2024-10-13 05:50:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:50:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:50:34,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:50:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:50:34,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:50:34,735 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:50:34,736 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:50:34,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:50:34,740 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:34,806 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:50:34,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:50:34 BoogieIcfgContainer [2024-10-13 05:50:34,811 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:50:34,812 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:50:34,812 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:50:34,813 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:50:34,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:18" (3/4) ... [2024-10-13 05:50:34,815 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:50:34,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:50:34,816 INFO L158 Benchmark]: Toolchain (without parser) took 17765.96ms. Allocated memory was 121.6MB in the beginning and 444.6MB in the end (delta: 323.0MB). Free memory was 53.1MB in the beginning and 374.3MB in the end (delta: -321.3MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-10-13 05:50:34,817 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:50:34,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.32ms. Allocated memory was 121.6MB in the beginning and 157.3MB in the end (delta: 35.7MB). Free memory was 52.8MB in the beginning and 124.4MB in the end (delta: -71.6MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-10-13 05:50:34,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.86ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 121.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:50:34,818 INFO L158 Benchmark]: Boogie Preprocessor took 66.06ms. Allocated memory is still 157.3MB. Free memory was 121.2MB in the beginning and 118.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:50:34,818 INFO L158 Benchmark]: RCFGBuilder took 500.69ms. Allocated memory is still 157.3MB. Free memory was 118.1MB in the beginning and 97.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 05:50:34,818 INFO L158 Benchmark]: TraceAbstraction took 16713.58ms. Allocated memory was 157.3MB in the beginning and 444.6MB in the end (delta: 287.3MB). Free memory was 96.1MB in the beginning and 374.3MB in the end (delta: -278.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-10-13 05:50:34,819 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 444.6MB. Free memory is still 374.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:50:34,820 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.16ms. Allocated memory is still 121.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.32ms. Allocated memory was 121.6MB in the beginning and 157.3MB in the end (delta: 35.7MB). Free memory was 52.8MB in the beginning and 124.4MB in the end (delta: -71.6MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.86ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 121.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.06ms. Allocated memory is still 157.3MB. Free memory was 121.2MB in the beginning and 118.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.69ms. Allocated memory is still 157.3MB. Free memory was 118.1MB in the beginning and 97.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16713.58ms. Allocated memory was 157.3MB in the beginning and 444.6MB in the end (delta: 287.3MB). Free memory was 96.1MB in the beginning and 374.3MB in the end (delta: -278.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 444.6MB. Free memory is still 374.3MB. 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 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] double var_1_8 = 8.3; [L28] double var_1_9 = 255.6; [L29] double var_1_10 = 10000000.375; [L30] double var_1_11 = 0.0; [L31] double var_1_12 = 255.375; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L68] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L72] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L73] var_1_12 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L74] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L78] var_1_16 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L79] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L93] RET updateVariables() [L94] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] COND FALSE !(stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) [L51] var_1_7 = (var_1_13 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L94] RET step() [L95] CALL, EXPR property() [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85-L86] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((double) (var_1_9 - var_1_10))) : (var_1_8 == ((double) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L19] reach_error() VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 759 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 751 mSDsluCounter, 2153 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1391 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1962 IncrementalHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 762 mSDtfsCounter, 1962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=12, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 204 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1299 NumberOfCodeBlocks, 1299 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1373 ConstructedInterpolants, 0 QuantifiedInterpolants, 5601 SizeOfPredicates, 6 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 4071/4224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:50:34,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.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 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:50:37,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:50:37,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:50:37,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:50:37,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:50:37,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:50:37,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:50:37,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:50:37,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:50:37,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:50:37,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:50:37,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:50:37,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:50:37,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:50:37,271 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:50:37,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:50:37,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:50:37,272 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:50:37,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:50:37,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:50:37,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:50:37,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:50:37,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:50:37,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:50:37,278 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:50:37,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:50:37,278 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:50:37,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:50:37,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:50:37,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:50:37,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:50:37,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:50:37,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:50:37,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:50:37,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:50:37,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:50:37,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:50:37,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:50:37,283 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:50:37,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:50:37,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:50:37,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:50:37,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:50:37,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:50:37,285 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:50:37,285 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 -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd [2024-10-13 05:50:37,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:50:37,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:50:37,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:50:37,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:50:37,648 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:50:37,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-10-13 05:50:39,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:50:39,364 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:50:39,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-10-13 05:50:39,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976c7cfb8/5e825abdbe4745d6b4cb4b3cc68d3a42/FLAGa6ea7d242 [2024-10-13 05:50:39,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976c7cfb8/5e825abdbe4745d6b4cb4b3cc68d3a42 [2024-10-13 05:50:39,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:50:39,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:50:39,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:50:39,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:50:39,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:50:39,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9584c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39, skipping insertion in model container [2024-10-13 05:50:39,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:50:39,626 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926] [2024-10-13 05:50:39,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:50:39,722 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:50:39,736 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926] [2024-10-13 05:50:39,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:50:39,786 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:50:39,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39 WrapperNode [2024-10-13 05:50:39,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:50:39,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:50:39,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:50:39,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:50:39,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,844 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-10-13 05:50:39,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:50:39,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:50:39,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:50:39,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:50:39,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,880 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:50:39,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:50:39,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:50:39,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:50:39,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:50:39,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (1/1) ... [2024-10-13 05:50:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:50:39,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:50:39,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:50:39,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:50:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:50:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:50:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:50:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:50:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:50:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:50:40,066 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:50:40,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:50:41,365 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:50:41,365 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:50:41,415 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:50:41,415 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:50:41,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:41 BoogieIcfgContainer [2024-10-13 05:50:41,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:50:41,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:50:41,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:50:41,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:50:41,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:50:39" (1/3) ... [2024-10-13 05:50:41,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de5c7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:50:41, skipping insertion in model container [2024-10-13 05:50:41,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:39" (2/3) ... [2024-10-13 05:50:41,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de5c7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:50:41, skipping insertion in model container [2024-10-13 05:50:41,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:41" (3/3) ... [2024-10-13 05:50:41,446 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2024-10-13 05:50:41,462 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:50:41,462 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:50:41,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:50:41,535 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;@2d331804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:50:41,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:50:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:50:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 05:50:41,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:41,555 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:41,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:41,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1254920039, now seen corresponding path program 1 times [2024-10-13 05:50:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:50:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743579037] [2024-10-13 05:50:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:41,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:50:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:50:41,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:50:41,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 05:50:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:41,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:50:41,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:50:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-13 05:50:41,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:50:41,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:50:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743579037] [2024-10-13 05:50:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743579037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:41,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:41,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:50:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639300666] [2024-10-13 05:50:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:41,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:50:41,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:50:41,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:50:41,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:50:41,998 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:50:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:42,582 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions. [2024-10-13 05:50:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:50:42,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-10-13 05:50:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:42,607 INFO L225 Difference]: With dead ends: 75 [2024-10-13 05:50:42,607 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 05:50:42,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:50:42,614 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:42,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:50:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 05:50:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-13 05:50:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:50:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2024-10-13 05:50:42,651 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 79 [2024-10-13 05:50:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:42,652 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2024-10-13 05:50:42,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:50:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2024-10-13 05:50:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 05:50:42,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:42,661 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:42,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 05:50:42,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:50:42,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:42,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1235641761, now seen corresponding path program 1 times [2024-10-13 05:50:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:50:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108933979] [2024-10-13 05:50:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:50:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:50:42,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:50:42,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 05:50:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:43,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 05:50:43,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:50:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:50:43,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:50:43,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:50:43,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108933979] [2024-10-13 05:50:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108933979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:50:43,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:50:43,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:50:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210237580] [2024-10-13 05:50:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:50:43,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:50:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:50:43,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:50:43,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:43,249 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:44,758 INFO L93 Difference]: Finished difference Result 73 states and 103 transitions. [2024-10-13 05:50:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:50:44,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-13 05:50:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:44,770 INFO L225 Difference]: With dead ends: 73 [2024-10-13 05:50:44,770 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 05:50:44,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:50:44,772 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:44,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 05:50:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 05:50:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-13 05:50:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:50:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-10-13 05:50:44,779 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 79 [2024-10-13 05:50:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:44,780 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-10-13 05:50:44,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:50:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-10-13 05:50:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 05:50:44,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:44,782 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:44,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 05:50:44,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:50:44,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:44,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1235701343, now seen corresponding path program 1 times [2024-10-13 05:50:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:50:44,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772317852] [2024-10-13 05:50:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:44,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:50:44,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:50:44,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:50:44,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 05:50:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:45,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:50:45,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:50:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 05:50:45,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:50:46,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:50:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772317852] [2024-10-13 05:50:46,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772317852] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:50:46,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1477033782] [2024-10-13 05:50:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:46,103 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:50:46,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:50:46,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:50:46,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-13 05:50:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:46,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 05:50:46,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:50:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 05:50:47,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:50:47,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1477033782] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:50:47,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:50:47,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-13 05:50:47,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865901728] [2024-10-13 05:50:47,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:50:47,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:50:47,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:50:47,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:50:47,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:50:47,530 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 05:50:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:50:49,683 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2024-10-13 05:50:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 05:50:49,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2024-10-13 05:50:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:50:49,685 INFO L225 Difference]: With dead ends: 103 [2024-10-13 05:50:49,687 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 05:50:49,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-13 05:50:49,689 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:50:49,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 88 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 05:50:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 05:50:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-10-13 05:50:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:50:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-10-13 05:50:49,710 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 79 [2024-10-13 05:50:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:50:49,711 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-10-13 05:50:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 05:50:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-10-13 05:50:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 05:50:49,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:50:49,716 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:50:49,728 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 (4)] Ended with exit code 0 [2024-10-13 05:50:49,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-10-13 05:50:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 05:50:50,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:50:50,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:50:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash 426354717, now seen corresponding path program 1 times [2024-10-13 05:50:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:50:50,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661592293] [2024-10-13 05:50:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:50:50,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:50:50,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:50:50,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:50:50,121 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 (6)] Waiting until timeout for monitored process [2024-10-13 05:50:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:50:50,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 05:50:50,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:51:37,847 WARN L286 SmtUtils]: Spent 17.64s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)