./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.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 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:06:41,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:06:41,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:06:41,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:06:41,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:06:41,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:06:41,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:06:41,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:06:41,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:06:41,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:06:41,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:06:41,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:06:41,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:06:41,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:06:41,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:06:41,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:06:41,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:06:41,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:06:41,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:06:41,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:06:41,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:06:41,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:06:41,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:06:41,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:06:41,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:06:41,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:06:41,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:06:41,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:06:41,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:06:41,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:06:41,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:06:41,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:06:41,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:06:41,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:06:41,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:06:41,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:06:41,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:06:41,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:06:41,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:06:41,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:06:41,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:06:41,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:06:41,197 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 -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2024-11-16 12:06:41,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:06:41,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:06:41,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:06:41,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:06:41,468 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:06:41,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-11-16 12:06:42,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:06:43,064 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:06:43,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-11-16 12:06:43,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cefb199d/6326e1104d764ced8cd5a559baf45bf4/FLAGbe85cef9c [2024-11-16 12:06:43,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cefb199d/6326e1104d764ced8cd5a559baf45bf4 [2024-11-16 12:06:43,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:06:43,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:06:43,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:06:43,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:06:43,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:06:43,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f85f7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43, skipping insertion in model container [2024-11-16 12:06:43,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:06:43,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-11-16 12:06:43,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:06:43,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:06:43,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-11-16 12:06:43,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:06:43,451 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:06:43,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43 WrapperNode [2024-11-16 12:06:43,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:06:43,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:06:43,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:06:43,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:06:43,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,506 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-16 12:06:43,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:06:43,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:06:43,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:06:43,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:06:43,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,542 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:06:43,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:06:43,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:06:43,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:06:43,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:06:43,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (1/1) ... [2024-11-16 12:06:43,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:06:43,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:06:43,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:06:43,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:06:43,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:06:43,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:06:43,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:06:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:06:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:06:43,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:06:43,737 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:06:43,739 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:06:44,117 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:06:44,117 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:06:44,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:06:44,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:06:44,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:06:44 BoogieIcfgContainer [2024-11-16 12:06:44,134 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:06:44,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:06:44,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:06:44,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:06:44,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:06:43" (1/3) ... [2024-11-16 12:06:44,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505c6980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:44, skipping insertion in model container [2024-11-16 12:06:44,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:43" (2/3) ... [2024-11-16 12:06:44,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505c6980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:44, skipping insertion in model container [2024-11-16 12:06:44,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:06:44" (3/3) ... [2024-11-16 12:06:44,149 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2024-11-16 12:06:44,166 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:06:44,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:06:44,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:06:44,226 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;@6511ba4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:06:44,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:06:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 12:06:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:06:44,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:06:44,248 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:06:44,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:06:44,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:06:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1394851401, now seen corresponding path program 1 times [2024-11-16 12:06:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:06:44,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562004107] [2024-11-16 12:06:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:06:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:06:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:06:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:06:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:06:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:06:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:06:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:06:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:06:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:06:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:06:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:06:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:06:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:06:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:06:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:06:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:06:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:06:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:06:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:06:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:06:44,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:06:44,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562004107] [2024-11-16 12:06:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562004107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:06:44,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:06:44,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:06:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220413049] [2024-11-16 12:06:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:06:44,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:06:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:06:44,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:06:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:06:44,701 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 12:06:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:06:44,728 INFO L93 Difference]: Finished difference Result 114 states and 197 transitions. [2024-11-16 12:06:44,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:06:44,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-11-16 12:06:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:06:44,739 INFO L225 Difference]: With dead ends: 114 [2024-11-16 12:06:44,739 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 12:06:44,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:06:44,746 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:06:44,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:06:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 12:06:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 12:06:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 12:06:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-11-16 12:06:44,787 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 118 [2024-11-16 12:06:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:06:44,788 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-11-16 12:06:44,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 12:06:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-11-16 12:06:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:06:44,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:06:44,793 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:06:44,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:06:44,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:06:44,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:06:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2108844631, now seen corresponding path program 1 times [2024-11-16 12:06:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:06:44,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568253008] [2024-11-16 12:06:44,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:06:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:06:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:06:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:06:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:06:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:06:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:06:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:06:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:06:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:06:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:06:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:06:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:06:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:06:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:06:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:06:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:06:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:06:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:06:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:06:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:06:48,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:06:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568253008] [2024-11-16 12:06:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568253008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:06:48,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:06:48,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:06:48,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382022613] [2024-11-16 12:06:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:06:48,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:06:48,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:06:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:06:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:06:48,982 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:06:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:06:49,813 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-16 12:06:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:06:49,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 12:06:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:06:49,817 INFO L225 Difference]: With dead ends: 232 [2024-11-16 12:06:49,819 INFO L226 Difference]: Without dead ends: 179 [2024-11-16 12:06:49,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:06:49,822 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 244 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:06:49,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 421 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:06:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-16 12:06:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 96. [2024-11-16 12:06:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:06:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-11-16 12:06:49,853 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 118 [2024-11-16 12:06:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:06:49,855 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-11-16 12:06:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:06:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-11-16 12:06:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:06:49,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:06:49,859 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:06:49,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:06:49,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:06:49,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:06:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2137473782, now seen corresponding path program 1 times [2024-11-16 12:06:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:06:49,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087456497] [2024-11-16 12:06:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:06:49,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:06:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:06:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:06:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:06:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:06:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:06:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:06:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:06:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:06:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:06:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:06:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:06:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:06:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:06:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:06:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:06:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:06:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:06:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:06:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:06:53,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:06:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087456497] [2024-11-16 12:06:53,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087456497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:06:53,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:06:53,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:06:53,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038872560] [2024-11-16 12:06:53,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:06:53,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:06:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:06:53,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:06:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:06:53,729 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:06:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:06:55,401 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2024-11-16 12:06:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:06:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 12:06:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:06:55,404 INFO L225 Difference]: With dead ends: 179 [2024-11-16 12:06:55,404 INFO L226 Difference]: Without dead ends: 176 [2024-11-16 12:06:55,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:06:55,406 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 184 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:06:55,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 440 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:06:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-16 12:06:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 96. [2024-11-16 12:06:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:06:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-11-16 12:06:55,439 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 118 [2024-11-16 12:06:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:06:55,442 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-11-16 12:06:55,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:06:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-11-16 12:06:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:06:55,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:06:55,445 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:06:55,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:06:55,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:06:55,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:06:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash 301390168, now seen corresponding path program 1 times [2024-11-16 12:06:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:06:55,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93633928] [2024-11-16 12:06:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:06:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:06:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:06:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:06:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:06:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:06:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:06:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:06:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:06:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:06:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:06:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:06:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:06:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:06:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:06:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:06:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:06:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:06:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:06:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:06:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:06:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:06:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:06:58,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93633928] [2024-11-16 12:06:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93633928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:06:58,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:06:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:06:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732179882] [2024-11-16 12:06:58,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:06:58,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:06:58,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:06:58,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:06:58,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:06:58,861 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:06:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:06:59,629 INFO L93 Difference]: Finished difference Result 186 states and 251 transitions. [2024-11-16 12:06:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:06:59,630 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 12:06:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:06:59,633 INFO L225 Difference]: With dead ends: 186 [2024-11-16 12:06:59,633 INFO L226 Difference]: Without dead ends: 183 [2024-11-16 12:06:59,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:06:59,638 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 169 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:06:59,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 445 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:06:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-16 12:06:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 99. [2024-11-16 12:06:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.445945945945946) internal successors, (107), 75 states have internal predecessors, (107), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:06:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions. [2024-11-16 12:06:59,661 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 118 [2024-11-16 12:06:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:06:59,663 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions. [2024-11-16 12:06:59,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:06:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions. [2024-11-16 12:06:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:06:59,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:06:59,667 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:06:59,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:06:59,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:06:59,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:06:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash 330019319, now seen corresponding path program 1 times [2024-11-16 12:06:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:06:59,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699860530] [2024-11-16 12:06:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:06:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:06:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:07:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:07:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:07:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:07:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:07:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:07:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:07:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:07:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:07:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:07:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:07:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:07:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:07:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:07:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:07:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:07:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:07:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:07:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:07:03,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:07:03,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699860530] [2024-11-16 12:07:03,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699860530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:07:03,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:07:03,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:07:03,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63715724] [2024-11-16 12:07:03,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:07:03,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:07:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:07:03,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:07:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:07:03,313 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:07:04,312 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-16 12:07:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:07:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 12:07:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:07:04,317 INFO L225 Difference]: With dead ends: 183 [2024-11-16 12:07:04,318 INFO L226 Difference]: Without dead ends: 180 [2024-11-16 12:07:04,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:07:04,319 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 162 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:07:04,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 506 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:07:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-16 12:07:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 96. [2024-11-16 12:07:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:07:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-11-16 12:07:04,333 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 118 [2024-11-16 12:07:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:07:04,334 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-11-16 12:07:04,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-11-16 12:07:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:07:04,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:04,339 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:04,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:07:04,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:04,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash 311893272, now seen corresponding path program 1 times [2024-11-16 12:07:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:07:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952477755] [2024-11-16 12:07:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:07:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:07:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:07:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:07:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:07:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:07:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:07:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:07:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:07:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:07:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:07:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:07:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:07:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:07:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:07:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:07:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:07:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:07:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:07:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:07:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:07:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952477755] [2024-11-16 12:07:04,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952477755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:07:04,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:07:04,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:07:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995574587] [2024-11-16 12:07:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:07:04,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:07:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:07:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:07:04,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:07:04,418 INFO L87 Difference]: Start difference. First operand 96 states and 146 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:07:04,464 INFO L93 Difference]: Finished difference Result 266 states and 407 transitions. [2024-11-16 12:07:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:07:04,465 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 12:07:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:07:04,468 INFO L225 Difference]: With dead ends: 266 [2024-11-16 12:07:04,468 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 12:07:04,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:07:04,471 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 73 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:07:04,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 218 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:07:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 12:07:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-11-16 12:07:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 123 states have internal predecessors, (164), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 12:07:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2024-11-16 12:07:04,517 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 118 [2024-11-16 12:07:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:07:04,518 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2024-11-16 12:07:04,518 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2024-11-16 12:07:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:07:04,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:04,520 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:07:04,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:04,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2054703607, now seen corresponding path program 1 times [2024-11-16 12:07:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:07:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499733959] [2024-11-16 12:07:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:07:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:07:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:07:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:07:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:07:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:07:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:07:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:07:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:07:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:07:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:07:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:07:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:07:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:07:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:07:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:07:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:07:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:07:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:07:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:07:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:07:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499733959] [2024-11-16 12:07:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499733959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:07:04,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:07:04,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:07:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453581219] [2024-11-16 12:07:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:07:04,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:07:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:07:04,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:07:04,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:07:04,658 INFO L87 Difference]: Start difference. First operand 170 states and 252 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:07:04,797 INFO L93 Difference]: Finished difference Result 507 states and 738 transitions. [2024-11-16 12:07:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:07:04,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 12:07:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:07:04,803 INFO L225 Difference]: With dead ends: 507 [2024-11-16 12:07:04,803 INFO L226 Difference]: Without dead ends: 340 [2024-11-16 12:07:04,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-11-16 12:07:04,805 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:07:04,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 214 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:07:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-16 12:07:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 293. [2024-11-16 12:07:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 200 states have (on average 1.32) internal successors, (264), 203 states have internal predecessors, (264), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-16 12:07:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 432 transitions. [2024-11-16 12:07:04,851 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 432 transitions. Word has length 118 [2024-11-16 12:07:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:07:04,851 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 432 transitions. [2024-11-16 12:07:04,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 432 transitions. [2024-11-16 12:07:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:07:04,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:04,853 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:04,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:07:04,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:04,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash 247249144, now seen corresponding path program 1 times [2024-11-16 12:07:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:07:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711122932] [2024-11-16 12:07:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:07:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:07:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:07:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:07:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:07:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:07:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:07:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:07:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:07:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:07:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:07:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:07:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:07:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:07:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:07:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:07:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:07:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:07:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:07:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:07:06,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:07:06,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711122932] [2024-11-16 12:07:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711122932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:07:06,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:07:06,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:07:06,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629857441] [2024-11-16 12:07:06,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:07:06,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:07:06,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:07:06,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:07:06,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:07:06,785 INFO L87 Difference]: Start difference. First operand 293 states and 432 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:07:07,452 INFO L93 Difference]: Finished difference Result 544 states and 729 transitions. [2024-11-16 12:07:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:07:07,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 12:07:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:07:07,456 INFO L225 Difference]: With dead ends: 544 [2024-11-16 12:07:07,456 INFO L226 Difference]: Without dead ends: 541 [2024-11-16 12:07:07,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:07:07,457 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 251 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:07:07,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 504 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:07:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-16 12:07:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 345. [2024-11-16 12:07:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 246 states have (on average 1.3130081300813008) internal successors, (323), 251 states have internal predecessors, (323), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-16 12:07:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 499 transitions. [2024-11-16 12:07:07,501 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 499 transitions. Word has length 118 [2024-11-16 12:07:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:07:07,502 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 499 transitions. [2024-11-16 12:07:07,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 499 transitions. [2024-11-16 12:07:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:07:07,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:07,503 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:07,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:07:07,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:07,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 275878295, now seen corresponding path program 1 times [2024-11-16 12:07:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:07:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035117094] [2024-11-16 12:07:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:07:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:07:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:07:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:07:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:07:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:07:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:07:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:07:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:07:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:07:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:07:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:07:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:07:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:07:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:07:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:07:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:07:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:07:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:07:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:07:09,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:07:09,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035117094] [2024-11-16 12:07:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035117094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:07:09,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:07:09,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:07:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183280850] [2024-11-16 12:07:09,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:07:09,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:07:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:07:09,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:07:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:07:09,500 INFO L87 Difference]: Start difference. First operand 345 states and 499 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:07:10,547 INFO L93 Difference]: Finished difference Result 541 states and 725 transitions. [2024-11-16 12:07:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:07:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 12:07:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:07:10,550 INFO L225 Difference]: With dead ends: 541 [2024-11-16 12:07:10,551 INFO L226 Difference]: Without dead ends: 538 [2024-11-16 12:07:10,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:07:10,552 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 234 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 12:07:10,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 526 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 12:07:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-16 12:07:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 345. [2024-11-16 12:07:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 246 states have (on average 1.3130081300813008) internal successors, (323), 251 states have internal predecessors, (323), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-16 12:07:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 499 transitions. [2024-11-16 12:07:10,599 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 499 transitions. Word has length 118 [2024-11-16 12:07:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:07:10,600 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 499 transitions. [2024-11-16 12:07:10,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 12:07:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 499 transitions. [2024-11-16 12:07:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:07:10,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:10,601 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:10,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:07:10,602 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:10,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2057039946, now seen corresponding path program 1 times [2024-11-16 12:07:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:07:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652423676] [2024-11-16 12:07:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:07:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:07:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:07:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:07:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:07:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:07:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:07:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:07:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:07:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:07:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:07:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:07:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:07:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:07:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:07:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:07:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:07:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:07:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:07:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 12:07:10,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:07:10,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652423676] [2024-11-16 12:07:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652423676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:07:10,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:07:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:07:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099880341] [2024-11-16 12:07:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:07:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:07:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:07:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:07:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:07:10,884 INFO L87 Difference]: Start difference. First operand 345 states and 499 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-16 12:07:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:07:11,070 INFO L93 Difference]: Finished difference Result 681 states and 966 transitions. [2024-11-16 12:07:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:07:11,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 118 [2024-11-16 12:07:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:07:11,074 INFO L225 Difference]: With dead ends: 681 [2024-11-16 12:07:11,074 INFO L226 Difference]: Without dead ends: 381 [2024-11-16 12:07:11,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:07:11,076 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 199 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:07:11,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 124 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:07:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-16 12:07:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 373. [2024-11-16 12:07:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 260 states have (on average 1.25) internal successors, (325), 266 states have internal predecessors, (325), 98 states have call successors, (98), 14 states have call predecessors, (98), 14 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-16 12:07:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2024-11-16 12:07:11,123 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 118 [2024-11-16 12:07:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:07:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2024-11-16 12:07:11,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-16 12:07:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2024-11-16 12:07:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 12:07:11,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:11,124 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 12:07:11,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1883806198, now seen corresponding path program 1 times [2024-11-16 12:07:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:07:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015847586] [2024-11-16 12:07:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:07:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:07:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963538517] [2024-11-16 12:07:11,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:11,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:07:11,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:07:11,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:07:11,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:07:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:11,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 12:07:11,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:07:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 93 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-16 12:07:12,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:07:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:07:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015847586] [2024-11-16 12:07:12,952 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 12:07:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963538517] [2024-11-16 12:07:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963538517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:07:12,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 12:07:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-16 12:07:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309531831] [2024-11-16 12:07:12,952 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 12:07:12,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 12:07:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:07:12,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 12:07:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-16 12:07:12,953 INFO L87 Difference]: Start difference. First operand 373 states and 521 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 12:07:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:07:13,680 INFO L93 Difference]: Finished difference Result 828 states and 1060 transitions. [2024-11-16 12:07:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 12:07:13,681 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 119 [2024-11-16 12:07:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:07:13,687 INFO L225 Difference]: With dead ends: 828 [2024-11-16 12:07:13,688 INFO L226 Difference]: Without dead ends: 497 [2024-11-16 12:07:13,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 12:07:13,691 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 127 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:07:13,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 256 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:07:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-16 12:07:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 311. [2024-11-16 12:07:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 224 states have (on average 1.1294642857142858) internal successors, (253), 230 states have internal predecessors, (253), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 12:07:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 373 transitions. [2024-11-16 12:07:13,769 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 373 transitions. Word has length 119 [2024-11-16 12:07:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:07:13,770 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 373 transitions. [2024-11-16 12:07:13,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 12:07:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 373 transitions. [2024-11-16 12:07:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 12:07:13,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:13,771 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:13,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:07:13,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 12:07:13,972 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:13,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1855177047, now seen corresponding path program 1 times [2024-11-16 12:07:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:07:13,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872569796] [2024-11-16 12:07:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:07:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:07:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483338593] [2024-11-16 12:07:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:14,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:07:14,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:07:14,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:07:14,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 12:07:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:07:14,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:07:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:07:14,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:07:14,252 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:07:14,253 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:07:14,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 12:07:14,455 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-11-16 12:07:14,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:14,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:07:14,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:07:14 BoogieIcfgContainer [2024-11-16 12:07:14,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:07:14,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:07:14,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:07:14,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:07:14,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:06:44" (3/4) ... [2024-11-16 12:07:14,558 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:07:14,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:07:14,560 INFO L158 Benchmark]: Toolchain (without parser) took 31460.60ms. Allocated memory was 155.2MB in the beginning and 524.3MB in the end (delta: 369.1MB). Free memory was 99.2MB in the beginning and 283.6MB in the end (delta: -184.4MB). Peak memory consumption was 185.5MB. Max. memory is 16.1GB. [2024-11-16 12:07:14,560 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:07:14,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.10ms. Allocated memory is still 155.2MB. Free memory was 99.2MB in the beginning and 84.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 12:07:14,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.95ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 81.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:07:14,561 INFO L158 Benchmark]: Boogie Preprocessor took 51.33ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 76.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:07:14,561 INFO L158 Benchmark]: IcfgBuilder took 569.36ms. Allocated memory is still 155.2MB. Free memory was 76.6MB in the beginning and 120.6MB in the end (delta: -44.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 12:07:14,562 INFO L158 Benchmark]: TraceAbstraction took 30414.85ms. Allocated memory was 155.2MB in the beginning and 524.3MB in the end (delta: 369.1MB). Free memory was 119.9MB in the beginning and 284.7MB in the end (delta: -164.8MB). Peak memory consumption was 207.5MB. Max. memory is 16.1GB. [2024-11-16 12:07:14,562 INFO L158 Benchmark]: Witness Printer took 5.19ms. Allocated memory is still 524.3MB. Free memory was 284.7MB in the beginning and 283.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:07:14,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.10ms. Allocated memory is still 155.2MB. Free memory was 99.2MB in the beginning and 84.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.95ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 81.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.33ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 76.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 569.36ms. Allocated memory is still 155.2MB. Free memory was 76.6MB in the beginning and 120.6MB in the end (delta: -44.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30414.85ms. Allocated memory was 155.2MB in the beginning and 524.3MB in the end (delta: 369.1MB). Free memory was 119.9MB in the beginning and 284.7MB in the end (delta: -164.8MB). Peak memory consumption was 207.5MB. Max. memory is 16.1GB. * Witness Printer took 5.19ms. Allocated memory is still 524.3MB. Free memory was 284.7MB in the beginning and 283.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L83] var_1_3 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L84] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L85] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L85] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L86] var_1_4 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L87] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L88] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L88] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] var_1_6 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=2, var_1_8=256] [L91] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=2, var_1_8=256] [L91] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=2, var_1_8=256] [L92] var_1_7 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L93] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L94] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L94] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L95] var_1_10 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L96] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L97] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L97] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L98] var_1_11 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L99] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L100] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L100] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L101] var_1_14 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L102] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L103] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L103] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L104] var_1_20 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L105] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L106] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L106] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L107] var_1_21 = __VERIFIER_nondet_short() [L108] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L108] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L109] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L109] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=256] [L123] RET updateVariables() [L124] CALL step() [L43] COND FALSE !(-25 == var_1_6) [L48] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=65534] [L50] COND TRUE var_1_8 >= var_1_7 [L51] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=65534] [L53] COND TRUE \read(var_1_12) [L54] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=65534] [L56] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=126, var_1_7=127, var_1_8=65534] [L57] COND TRUE \read(var_1_12) [L58] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=126, var_1_7=127, var_1_8=65534] [L61] COND TRUE var_1_1 < var_1_6 [L62] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=126, var_1_7=127, var_1_8=65534] [L66] COND TRUE \read(var_1_12) [L67] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=-16130, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=126, var_1_7=127, var_1_8=65534] [L69] COND TRUE -64 > (var_1_6 + var_1_19) [L70] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_18=-1, var_1_19=-16130, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=126, var_1_7=127, var_1_8=65534] [L78] COND FALSE !(var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_18=-1, var_1_19=-16130, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=126, var_1_7=127, var_1_8=65534] [L124] RET step() [L125] CALL, EXPR property() [L115-L116] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_18=-1, var_1_19=-16130, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=126, var_1_7=127, var_1_8=65534] [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_18=-1, var_1_19=-16130, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=126, var_1_7=127, var_1_8=65534] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_18=-1, var_1_19=-16130, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=126, var_1_7=127, var_1_8=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1719 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1714 mSDsluCounter, 3739 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2700 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2419 IncrementalHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 1039 mSDtfsCounter, 2419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 630 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=10, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 964 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 1656 NumberOfCodeBlocks, 1656 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9647 SizeOfPredicates, 7 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 6639/6732 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 12:07:14,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.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 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:07:16,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:07:16,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:07:16,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:07:16,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:07:17,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:07:17,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:07:17,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:07:17,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:07:17,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:07:17,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:07:17,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:07:17,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:07:17,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:07:17,011 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:07:17,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:07:17,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:07:17,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:07:17,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:07:17,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:07:17,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:07:17,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:07:17,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:07:17,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:07:17,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:07:17,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:07:17,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:07:17,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:07:17,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:07:17,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:07:17,016 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:07:17,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:07:17,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:07:17,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:07:17,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:07:17,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:07:17,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:07:17,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:07:17,017 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:07:17,017 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:07:17,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:07:17,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:07:17,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:07:17,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:07:17,019 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 -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2024-11-16 12:07:17,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:07:17,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:07:17,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:07:17,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:07:17,429 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:07:17,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-11-16 12:07:19,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:07:19,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:07:19,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-11-16 12:07:19,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54e270b6/b810514f651c423a9ff7065e9d9e2a66/FLAG7d09bd2a0 [2024-11-16 12:07:19,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a54e270b6/b810514f651c423a9ff7065e9d9e2a66 [2024-11-16 12:07:19,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:07:19,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:07:19,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:07:19,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:07:19,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:07:19,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bddc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19, skipping insertion in model container [2024-11-16 12:07:19,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:07:19,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-11-16 12:07:19,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:07:19,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:07:19,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-11-16 12:07:19,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:07:19,786 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:07:19,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19 WrapperNode [2024-11-16 12:07:19,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:07:19,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:07:19,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:07:19,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:07:19,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,840 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 12:07:19,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:07:19,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:07:19,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:07:19,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:07:19,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,881 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:07:19,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:07:19,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:07:19,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:07:19,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:07:19,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (1/1) ... [2024-11-16 12:07:19,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:07:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:07:19,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:07:19,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:07:20,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:07:20,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:07:20,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:07:20,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:07:20,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:07:20,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:07:20,116 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:07:20,119 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:07:20,611 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:07:20,612 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:07:20,629 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:07:20,630 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:07:20,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:07:20 BoogieIcfgContainer [2024-11-16 12:07:20,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:07:20,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:07:20,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:07:20,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:07:20,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:07:19" (1/3) ... [2024-11-16 12:07:20,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af76aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:20, skipping insertion in model container [2024-11-16 12:07:20,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:19" (2/3) ... [2024-11-16 12:07:20,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af76aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:20, skipping insertion in model container [2024-11-16 12:07:20,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:07:20" (3/3) ... [2024-11-16 12:07:20,642 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2024-11-16 12:07:20,664 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:07:20,664 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:07:20,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:07:20,751 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;@6c1ef33d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:07:20,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:07:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 12:07:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:07:20,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:20,772 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:20,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:20,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1394851401, now seen corresponding path program 1 times [2024-11-16 12:07:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:07:20,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073159210] [2024-11-16 12:07:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:20,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:07:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:07:20,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:07:20,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:07:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:21,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:07:21,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:07:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-16 12:07:21,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:07:21,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:07:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073159210] [2024-11-16 12:07:21,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073159210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:07:21,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:07:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:07:21,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447298380] [2024-11-16 12:07:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:07:21,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:07:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:07:21,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:07:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:07:21,104 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 12:07:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:07:21,140 INFO L93 Difference]: Finished difference Result 114 states and 197 transitions. [2024-11-16 12:07:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:07:21,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-11-16 12:07:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:07:21,150 INFO L225 Difference]: With dead ends: 114 [2024-11-16 12:07:21,151 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 12:07:21,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:07:21,161 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:07:21,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:07:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 12:07:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 12:07:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 12:07:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-11-16 12:07:21,224 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 118 [2024-11-16 12:07:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:07:21,226 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-11-16 12:07:21,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 12:07:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-11-16 12:07:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 12:07:21,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:07:21,232 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:07:21,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:07:21,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:07:21,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:07:21,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:07:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2108844631, now seen corresponding path program 1 times [2024-11-16 12:07:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:07:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797963364] [2024-11-16 12:07:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:07:21,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:07:21,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:07:21,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:07:21,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:07:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:07:21,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 12:07:21,646 INFO L278 TraceCheckSpWp]: Computing forward predicates...