./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.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_loopvsstraightlinecode_50-while_file-59.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 b76efa245cf05811296f1821b79f17cce14cc81fdc5d172c0831b55020eb32b3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:56:25,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:56:25,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:56:25,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:56:25,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:56:25,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:56:25,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:56:25,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:56:25,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:56:25,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:56:25,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:56:25,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:56:25,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:56:25,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:56:25,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:56:25,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:56:25,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:56:25,884 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:56:25,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:56:25,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:56:25,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:56:25,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:56:25,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:56:25,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:56:25,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:56:25,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:56:25,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:56:25,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:56:25,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:56:25,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:56:25,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:56:25,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:56:25,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:56:25,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:56:25,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:56:25,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:56:25,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:56:25,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:56:25,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:56:25,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:56:25,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:56:25,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:56:25,894 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 -> b76efa245cf05811296f1821b79f17cce14cc81fdc5d172c0831b55020eb32b3 [2024-11-16 16:56:26,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:56:26,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:56:26,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:56:26,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:56:26,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:56:26,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.i [2024-11-16 16:56:27,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:56:27,858 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:56:27,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-59.i [2024-11-16 16:56:27,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4edd7289/b38242791e0b4f759c22c369fcec1773/FLAG44255ef5e [2024-11-16 16:56:28,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4edd7289/b38242791e0b4f759c22c369fcec1773 [2024-11-16 16:56:28,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:56:28,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:56:28,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:56:28,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:56:28,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:56:28,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42508450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28, skipping insertion in model container [2024-11-16 16:56:28,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:56:28,447 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_50-while_file-59.i[915,928] [2024-11-16 16:56:28,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:56:28,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:56:28,534 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_50-while_file-59.i[915,928] [2024-11-16 16:56:28,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:56:28,586 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:56:28,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28 WrapperNode [2024-11-16 16:56:28,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:56:28,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:56:28,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:56:28,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:56:28,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,641 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-16 16:56:28,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:56:28,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:56:28,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:56:28,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:56:28,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,680 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 16:56:28,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:56:28,703 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:56:28,703 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:56:28,703 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:56:28,704 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (1/1) ... [2024-11-16 16:56:28,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:56:28,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:56:28,746 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 16:56:28,752 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 16:56:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:56:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:56:28,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:56:28,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:56:28,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:56:28,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:56:28,885 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:56:28,887 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:56:29,309 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 16:56:29,309 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:56:29,327 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:56:29,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:56:29,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:56:29 BoogieIcfgContainer [2024-11-16 16:56:29,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:56:29,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:56:29,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:56:29,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:56:29,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:56:28" (1/3) ... [2024-11-16 16:56:29,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f46eba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:56:29, skipping insertion in model container [2024-11-16 16:56:29,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:56:28" (2/3) ... [2024-11-16 16:56:29,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f46eba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:56:29, skipping insertion in model container [2024-11-16 16:56:29,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:56:29" (3/3) ... [2024-11-16 16:56:29,342 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-59.i [2024-11-16 16:56:29,357 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:56:29,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:56:29,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:56:29,428 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;@14edd446, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:56:29,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:56:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:56:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 16:56:29,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:56:29,446 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:56:29,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:56:29,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:56:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash 743751383, now seen corresponding path program 1 times [2024-11-16 16:56:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:56:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024345117] [2024-11-16 16:56:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:56:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:56:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:56:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:56:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:56:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:56:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:56:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:56:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:56:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:56:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:56:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:56:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:56:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:56:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:56:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:56:29,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:56:29,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024345117] [2024-11-16 16:56:29,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024345117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:56:29,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:56:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:56:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697854910] [2024-11-16 16:56:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:56:29,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:56:29,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:56:29,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:56:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:56:29,822 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:56:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:56:29,844 INFO L93 Difference]: Finished difference Result 106 states and 173 transitions. [2024-11-16 16:56:29,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:56:29,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-11-16 16:56:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:56:29,854 INFO L225 Difference]: With dead ends: 106 [2024-11-16 16:56:29,854 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 16:56:29,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 16:56:29,860 INFO L432 NwaCegarLoop]: 75 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, 75 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 16:56:29,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:56:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 16:56:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-16 16:56:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:56:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-16 16:56:29,929 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 97 [2024-11-16 16:56:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:56:29,929 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-16 16:56:29,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:56:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-16 16:56:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 16:56:29,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:56:29,955 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:56:29,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:56:29,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:56:29,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:56:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1859539963, now seen corresponding path program 1 times [2024-11-16 16:56:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:56:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515225006] [2024-11-16 16:56:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:56:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:56:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:56:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:56:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:56:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:56:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:56:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:56:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:56:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:56:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:56:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:56:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:56:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:56:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:56:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:56:30,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:56:30,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515225006] [2024-11-16 16:56:30,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515225006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:56:30,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:56:30,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:56:30,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130268471] [2024-11-16 16:56:30,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:56:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:56:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:56:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:56:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:56:30,503 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:56:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:56:30,641 INFO L93 Difference]: Finished difference Result 152 states and 221 transitions. [2024-11-16 16:56:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:56:30,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-16 16:56:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:56:30,646 INFO L225 Difference]: With dead ends: 152 [2024-11-16 16:56:30,646 INFO L226 Difference]: Without dead ends: 103 [2024-11-16 16:56:30,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 16:56:30,650 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:56:30,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 209 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:56:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-16 16:56:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2024-11-16 16:56:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 16:56:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-16 16:56:30,681 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 97 [2024-11-16 16:56:30,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:56:30,682 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-16 16:56:30,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:56:30,682 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-16 16:56:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:56:30,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:56:30,684 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:56:30,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:56:30,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:56:30,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:56:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1659627081, now seen corresponding path program 1 times [2024-11-16 16:56:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:56:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296002808] [2024-11-16 16:56:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:56:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:56:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:56:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:56:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:56:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:56:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:56:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:56:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:56:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:56:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:56:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:56:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:56:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:56:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:56:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:56:31,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:56:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296002808] [2024-11-16 16:56:31,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296002808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:56:31,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:56:31,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:56:31,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847722645] [2024-11-16 16:56:31,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:56:31,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:56:31,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:56:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:56:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:56:31,357 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:56:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:56:31,620 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2024-11-16 16:56:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:56:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-11-16 16:56:31,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:56:31,625 INFO L225 Difference]: With dead ends: 192 [2024-11-16 16:56:31,626 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 16:56:31,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:56:31,628 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 127 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:56:31,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:56:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 16:56:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-11-16 16:56:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 16:56:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2024-11-16 16:56:31,665 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 98 [2024-11-16 16:56:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:56:31,666 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2024-11-16 16:56:31,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:56:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2024-11-16 16:56:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:56:31,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:56:31,668 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:56:31,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:56:31,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:56:31,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:56:31,669 INFO L85 PathProgramCache]: Analyzing trace with hash -165108322, now seen corresponding path program 1 times [2024-11-16 16:56:31,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:56:31,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511581930] [2024-11-16 16:56:31,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:31,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:56:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:56:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:56:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:56:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:56:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:56:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:56:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:56:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:56:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:56:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:56:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:56:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:56:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 16:56:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:56:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-16 16:56:32,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:56:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511581930] [2024-11-16 16:56:32,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511581930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:56:32,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767213191] [2024-11-16 16:56:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:32,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:56:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:56:32,278 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 16:56:32,285 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 16:56:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:32,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 16:56:32,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:56:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-16 16:56:32,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:56:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767213191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:56:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:56:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-16 16:56:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778124593] [2024-11-16 16:56:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:56:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:56:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:56:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:56:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:56:32,533 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:56:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:56:32,932 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2024-11-16 16:56:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 16:56:32,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-16 16:56:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:56:32,936 INFO L225 Difference]: With dead ends: 368 [2024-11-16 16:56:32,936 INFO L226 Difference]: Without dead ends: 273 [2024-11-16 16:56:32,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2024-11-16 16:56:32,938 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 216 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:56:32,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 172 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:56:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-16 16:56:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 166. [2024-11-16 16:56:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.219298245614035) internal successors, (139), 114 states have internal predecessors, (139), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 16:56:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2024-11-16 16:56:32,971 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 99 [2024-11-16 16:56:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:56:32,972 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2024-11-16 16:56:32,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:56:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2024-11-16 16:56:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:56:32,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:56:32,976 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:56:32,995 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-16 16:56:33,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:56:33,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:56:33,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:56:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1577702013, now seen corresponding path program 1 times [2024-11-16 16:56:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:56:33,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874553549] [2024-11-16 16:56:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:56:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:56:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942869665] [2024-11-16 16:56:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:33,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:56:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:56:33,253 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 16:56:33,254 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 16:56:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:33,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 16:56:33,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:56:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 133 proven. 81 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-16 16:56:34,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:56:42,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:56:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874553549] [2024-11-16 16:56:42,257 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 16:56:42,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942869665] [2024-11-16 16:56:42,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942869665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:56:42,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:56:42,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-16 16:56:42,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862627778] [2024-11-16 16:56:42,258 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 16:56:42,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 16:56:42,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:56:42,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 16:56:42,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-16 16:56:42,260 INFO L87 Difference]: Start difference. First operand 166 states and 223 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-16 16:56:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:56:43,008 INFO L93 Difference]: Finished difference Result 326 states and 422 transitions. [2024-11-16 16:56:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 16:56:43,009 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 99 [2024-11-16 16:56:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:56:43,011 INFO L225 Difference]: With dead ends: 326 [2024-11-16 16:56:43,011 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 16:56:43,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-11-16 16:56:43,015 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 61 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:56:43,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 393 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:56:43,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 16:56:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2024-11-16 16:56:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 132 states have internal predecessors, (156), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 16:56:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 240 transitions. [2024-11-16 16:56:43,046 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 240 transitions. Word has length 99 [2024-11-16 16:56:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:56:43,048 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 240 transitions. [2024-11-16 16:56:43,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-16 16:56:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 240 transitions. [2024-11-16 16:56:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:56:43,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:56:43,052 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:56:43,070 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 16:56:43,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:56:43,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:56:43,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:56:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash 128294685, now seen corresponding path program 1 times [2024-11-16 16:56:43,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:56:43,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613505492] [2024-11-16 16:56:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:43,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:56:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:56:43,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058930800] [2024-11-16 16:56:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:56:43,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:56:43,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:56:43,344 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-16 16:56:43,345 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-16 16:56:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:56:43,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-16 16:56:43,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:56:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-16 16:56:44,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:56:51,005 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 16:57:29,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false [2024-11-16 16:57:35,471 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 16:57:55,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod c_~var_1_17~0 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_9 Int)) (or (not (= (mod (* v_z_9 .cse2) 4294967296) v_z_9)) (< v_z_9 .cse1) (< v_z_9 .cse5) (< .cse6 v_z_9))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false