./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-98.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 6f9402c7018e79bcd90f9f57f21a87c915654b2dc0bedc517c733595f96920b4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:26:51,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:26:51,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:26:51,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:26:51,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:26:51,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:26:51,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:26:51,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:26:51,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:26:51,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:26:51,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:26:51,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:26:51,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:26:51,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:26:51,444 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:26:51,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:26:51,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:26:51,445 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:26:51,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:26:51,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:26:51,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:26:51,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:26:51,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:26:51,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:26:51,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:26:51,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:26:51,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:26:51,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:26:51,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:26:51,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:26:51,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:26:51,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:26:51,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:26:51,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:26:51,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:26:51,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:26:51,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:26:51,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:26:51,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:26:51,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:26:51,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:26:51,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:26:51,457 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 -> 6f9402c7018e79bcd90f9f57f21a87c915654b2dc0bedc517c733595f96920b4 [2024-11-08 23:26:51,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:26:51,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:26:51,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:26:51,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:26:51,713 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:26:51,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-98.i [2024-11-08 23:26:53,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:26:53,333 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:26:53,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-98.i [2024-11-08 23:26:53,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1951ec5f/93bfaccfad3344a8acb4e844b7aa2072/FLAG029c6e4c4 [2024-11-08 23:26:53,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1951ec5f/93bfaccfad3344a8acb4e844b7aa2072 [2024-11-08 23:26:53,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:26:53,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:26:53,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:26:53,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:26:53,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:26:53,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3faff980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53, skipping insertion in model container [2024-11-08 23:26:53,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:26:53,577 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_loopvsstraightlinecode_100-1loop_file-98.i[916,929] [2024-11-08 23:26:53,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:26:53,679 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:26:53,688 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_loopvsstraightlinecode_100-1loop_file-98.i[916,929] [2024-11-08 23:26:53,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:26:53,745 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:26:53,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53 WrapperNode [2024-11-08 23:26:53,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:26:53,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:26:53,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:26:53,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:26:53,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,795 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-08 23:26:53,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:26:53,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:26:53,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:26:53,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:26:53,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,839 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:26:53,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:26:53,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:26:53,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:26:53,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:26:53,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (1/1) ... [2024-11-08 23:26:53,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:26:53,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:26:53,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:26:53,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:26:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:26:53,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:26:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:26:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:26:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:26:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:26:54,038 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:26:54,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:26:54,388 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:26:54,388 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:26:54,403 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:26:54,403 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:26:54,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:54 BoogieIcfgContainer [2024-11-08 23:26:54,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:26:54,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:26:54,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:26:54,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:26:54,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:26:53" (1/3) ... [2024-11-08 23:26:54,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f95b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:26:54, skipping insertion in model container [2024-11-08 23:26:54,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:53" (2/3) ... [2024-11-08 23:26:54,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f95b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:26:54, skipping insertion in model container [2024-11-08 23:26:54,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:54" (3/3) ... [2024-11-08 23:26:54,414 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-98.i [2024-11-08 23:26:54,428 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:26:54,428 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:26:54,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:26:54,486 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;@5b1e7300, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:26:54,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:26:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:26:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:26:54,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:54,504 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:26:54,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:54,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1509306696, now seen corresponding path program 1 times [2024-11-08 23:26:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:26:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716266259] [2024-11-08 23:26:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:26:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:26:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:26:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:26:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:26:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:26:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:26:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:26:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:26:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:26:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:26:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:26:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:26:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:26:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:26:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:26:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:26:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:26:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:26:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:26:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:26:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:26:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:26:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:26:55,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:26:55,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716266259] [2024-11-08 23:26:55,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716266259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:55,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:55,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:26:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671896360] [2024-11-08 23:26:55,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:55,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:26:55,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:26:55,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:26:55,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:26:55,116 INFO L87 Difference]: Start difference. First operand has 78 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:26:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:55,152 INFO L93 Difference]: Finished difference Result 153 states and 260 transitions. [2024-11-08 23:26:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:26:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-11-08 23:26:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:55,161 INFO L225 Difference]: With dead ends: 153 [2024-11-08 23:26:55,161 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 23:26:55,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:26:55,168 INFO L432 NwaCegarLoop]: 117 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, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:55,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:26:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 23:26:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 23:26:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:26:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-08 23:26:55,228 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 152 [2024-11-08 23:26:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:55,229 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-08 23:26:55,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:26:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-08 23:26:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:26:55,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:55,235 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:26:55,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:26:55,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:55,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash 431303750, now seen corresponding path program 1 times [2024-11-08 23:26:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:26:55,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815300771] [2024-11-08 23:26:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:26:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:26:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:26:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:26:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:26:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:26:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:26:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:26:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:26:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:26:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:26:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:26:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:26:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:26:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:26:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:26:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:26:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:26:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:26:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:26:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:26:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:26:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:26:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:26:57,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:26:57,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815300771] [2024-11-08 23:26:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815300771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:26:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462377023] [2024-11-08 23:26:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:57,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:26:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:26:57,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:26:57,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:26:57,263 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:26:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:57,589 INFO L93 Difference]: Finished difference Result 234 states and 355 transitions. [2024-11-08 23:26:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:26:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-11-08 23:26:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:57,593 INFO L225 Difference]: With dead ends: 234 [2024-11-08 23:26:57,593 INFO L226 Difference]: Without dead ends: 163 [2024-11-08 23:26:57,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:26:57,596 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 169 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:57,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 398 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:26:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-08 23:26:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2024-11-08 23:26:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:26:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions. [2024-11-08 23:26:57,626 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 152 [2024-11-08 23:26:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:57,627 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 224 transitions. [2024-11-08 23:26:57,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:26:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions. [2024-11-08 23:26:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:26:57,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:57,631 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:26:57,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:26:57,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:57,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1157044152, now seen corresponding path program 1 times [2024-11-08 23:26:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:26:57,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827460545] [2024-11-08 23:26:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:26:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:26:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:26:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:26:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:26:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:26:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:26:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:26:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:26:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:26:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:26:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:26:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:26:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:26:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:26:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:26:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:26:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:26:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:26:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:26:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:26:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:26:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:26:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:26:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:26:58,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827460545] [2024-11-08 23:26:58,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827460545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:26:58,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493342273] [2024-11-08 23:26:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:58,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:26:58,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:26:58,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:26:58,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:26:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:58,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:26:58,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-08 23:26:58,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:26:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:26:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493342273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:26:58,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:26:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:26:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970927772] [2024-11-08 23:26:58,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:26:58,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:26:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:26:58,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:26:58,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:26:58,786 INFO L87 Difference]: Start difference. First operand 147 states and 224 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 23:26:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:59,002 INFO L93 Difference]: Finished difference Result 309 states and 461 transitions. [2024-11-08 23:26:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:26:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 152 [2024-11-08 23:26:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:59,006 INFO L225 Difference]: With dead ends: 309 [2024-11-08 23:26:59,008 INFO L226 Difference]: Without dead ends: 165 [2024-11-08 23:26:59,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:26:59,012 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 119 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:59,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 201 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:26:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-08 23:26:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2024-11-08 23:26:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 103 states have internal predecessors, (134), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:26:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2024-11-08 23:26:59,054 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 152 [2024-11-08 23:26:59,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:59,055 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2024-11-08 23:26:59,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 23:26:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2024-11-08 23:26:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:26:59,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:59,057 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:26:59,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:26:59,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:26:59,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:59,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash -130821762, now seen corresponding path program 1 times [2024-11-08 23:26:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:26:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748465778] [2024-11-08 23:26:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:59,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:26:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:26:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:26:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:26:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:26:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:26:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:26:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:26:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:26:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:26:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:26:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:26:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:26:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:26:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:26:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:26:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:26:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:26:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:26:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:26:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:26:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:26:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:26:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:26:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:26:59,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748465778] [2024-11-08 23:26:59,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748465778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:26:59,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698023112] [2024-11-08 23:26:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:59,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:26:59,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:26:59,751 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-08 23:26:59,752 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-08 23:26:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:59,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 23:26:59,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-08 23:27:00,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:27:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:27:00,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698023112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:27:00,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:27:00,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2024-11-08 23:27:00,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505885121] [2024-11-08 23:27:00,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:27:00,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 23:27:00,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:00,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 23:27:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-08 23:27:00,903 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) [2024-11-08 23:27:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:01,759 INFO L93 Difference]: Finished difference Result 491 states and 710 transitions. [2024-11-08 23:27:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 23:27:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) Word has length 153 [2024-11-08 23:27:01,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:01,764 INFO L225 Difference]: With dead ends: 491 [2024-11-08 23:27:01,764 INFO L226 Difference]: Without dead ends: 339 [2024-11-08 23:27:01,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2024-11-08 23:27:01,766 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 398 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:01,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 645 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:27:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-08 23:27:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 212. [2024-11-08 23:27:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 133 states have (on average 1.2330827067669172) internal successors, (164), 133 states have internal predecessors, (164), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-08 23:27:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 302 transitions. [2024-11-08 23:27:01,813 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 302 transitions. Word has length 153 [2024-11-08 23:27:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 302 transitions. [2024-11-08 23:27:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) [2024-11-08 23:27:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 302 transitions. [2024-11-08 23:27:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 23:27:01,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:01,818 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:01,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:27:02,018 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,SelfDestructingSolverStorable3 [2024-11-08 23:27:02,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:02,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2124966468, now seen corresponding path program 1 times [2024-11-08 23:27:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265794850] [2024-11-08 23:27:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:27:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:27:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:27:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:27:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:27:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:27:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:27:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:27:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:27:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:27:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:27:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:27:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:27:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:27:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:27:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 23:27:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:27:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 23:27:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 129 proven. 51 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-08 23:27:12,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:12,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265794850] [2024-11-08 23:27:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265794850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:27:12,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666655267] [2024-11-08 23:27:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:12,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:27:12,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:12,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:27:12,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:27:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:12,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-08 23:27:12,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 507 proven. 222 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-11-08 23:27:17,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:27:29,471 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:27:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666655267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:27:54,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:27:54,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 35] total 50 [2024-11-08 23:27:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894530679] [2024-11-08 23:27:54,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:27:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-08 23:27:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-08 23:27:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=3291, Unknown=0, NotChecked=0, Total=3782 [2024-11-08 23:27:54,665 INFO L87 Difference]: Start difference. First operand 212 states and 302 transitions. Second operand has 50 states, 49 states have (on average 2.122448979591837) internal successors, (104), 44 states have internal predecessors, (104), 13 states have call successors, (46), 8 states have call predecessors, (46), 11 states have return successors, (46), 15 states have call predecessors, (46), 13 states have call successors, (46)