./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:22:58,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:22:58,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:22:58,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:22:58,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:22:58,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:22:58,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:22:58,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:22:58,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:22:58,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:22:58,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:22:58,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:22:58,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:22:58,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:22:58,656 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:22:58,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:22:58,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:22:58,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:22:58,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:22:58,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:22:58,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:22:58,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:22:58,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:22:58,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:22:58,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:22:58,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:22:58,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:22:58,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:22:58,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:22:58,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:22:58,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:22:58,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:22:58,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:58,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:22:58,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:22:58,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:22:58,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:22:58,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:22:58,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:22:58,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:22:58,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:22:58,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:22:58,667 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:22:58,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:22:58,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:22:58,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:22:58,893 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:22:58,896 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:22:58,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-09-11 19:23:00,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:23:00,373 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:23:00,374 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-09-11 19:23:00,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/00f73407b/e3bf1caf94bc432c9a6e1b47a1592a2b/FLAG2bd4e085b [2024-09-11 19:23:00,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/00f73407b/e3bf1caf94bc432c9a6e1b47a1592a2b [2024-09-11 19:23:00,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:23:00,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:23:00,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:00,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:23:00,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:23:00,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215127a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00, skipping insertion in model container [2024-09-11 19:23:00,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:23:00,560 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i[804,817] [2024-09-11 19:23:00,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:00,587 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:23:00,597 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i[804,817] [2024-09-11 19:23:00,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:00,617 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:23:00,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00 WrapperNode [2024-09-11 19:23:00,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:00,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:00,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:23:00,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:23:00,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,648 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2024-09-11 19:23:00,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:00,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:23:00,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:23:00,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:23:00,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,677 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-09-11 19:23:00,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:23:00,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:23:00,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:23:00,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:23:00,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (1/1) ... [2024-09-11 19:23:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:23:00,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:00,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 19:23:00,719 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 19:23:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:23:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:23:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:23:00,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:23:00,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:23:00,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:23:00,805 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:23:00,807 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:23:00,883 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-11 19:23:00,884 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:23:00,899 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:23:00,899 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:23:00,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:00 BoogieIcfgContainer [2024-09-11 19:23:00,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:23:00,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:23:00,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:23:00,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:23:00,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:23:00" (1/3) ... [2024-09-11 19:23:00,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14986bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:23:00, skipping insertion in model container [2024-09-11 19:23:00,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:00" (2/3) ... [2024-09-11 19:23:00,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14986bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:23:00, skipping insertion in model container [2024-09-11 19:23:00,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:00" (3/3) ... [2024-09-11 19:23:00,906 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2024-09-11 19:23:00,919 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:23:00,919 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:23:00,959 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:23:00,965 INFO L336 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=All, 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;@529f1149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:23:00,965 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:23:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:23:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:23:00,974 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:00,975 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:00,975 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:00,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:00,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1998107271, now seen corresponding path program 1 times [2024-09-11 19:23:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:00,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708565292] [2024-09-11 19:23:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:01,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708565292] [2024-09-11 19:23:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708565292] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:01,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:01,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529957628] [2024-09-11 19:23:01,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,119 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:01,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:01,138 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:01,162 INFO L93 Difference]: Finished difference Result 40 states and 72 transitions. [2024-09-11 19:23:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-09-11 19:23:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:01,169 INFO L225 Difference]: With dead ends: 40 [2024-09-11 19:23:01,169 INFO L226 Difference]: Without dead ends: 19 [2024-09-11 19:23:01,171 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:01,174 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:01,175 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-11 19:23:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-11 19:23:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:23:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2024-09-11 19:23:01,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 7 [2024-09-11 19:23:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:01,207 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-09-11 19:23:01,207 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:01,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2024-09-11 19:23:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:23:01,208 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:01,209 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:01,209 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:23:01,209 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:01,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1996498557, now seen corresponding path program 1 times [2024-09-11 19:23:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421450568] [2024-09-11 19:23:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421450568] [2024-09-11 19:23:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421450568] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:01,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:01,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:23:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865651584] [2024-09-11 19:23:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,400 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:01,401 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:01,497 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-09-11 19:23:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:01,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-09-11 19:23:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:01,498 INFO L225 Difference]: With dead ends: 25 [2024-09-11 19:23:01,499 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 19:23:01,499 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:01,501 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:01,501 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 19:23:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-11 19:23:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:23:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-09-11 19:23:01,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 7 [2024-09-11 19:23:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:01,513 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-09-11 19:23:01,513 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:01,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-09-11 19:23:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-11 19:23:01,517 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:01,517 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:01,517 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:23:01,518 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:01,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2106031398, now seen corresponding path program 1 times [2024-09-11 19:23:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:01,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810329829] [2024-09-11 19:23:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 19:23:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810329829] [2024-09-11 19:23:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810329829] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:01,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:01,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:23:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211007660] [2024-09-11 19:23:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,655 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:23:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:23:01,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:01,656 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:23:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:01,727 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-09-11 19:23:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:23:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-11 19:23:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:01,728 INFO L225 Difference]: With dead ends: 41 [2024-09-11 19:23:01,728 INFO L226 Difference]: Without dead ends: 39 [2024-09-11 19:23:01,729 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:23:01,729 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:01,730 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-11 19:23:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-09-11 19:23:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 19:23:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-09-11 19:23:01,739 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 12 [2024-09-11 19:23:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:01,740 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-09-11 19:23:01,740 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:23:01,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-09-11 19:23:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 19:23:01,741 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:01,741 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:01,741 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:23:01,741 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:01,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2121220317, now seen corresponding path program 1 times [2024-09-11 19:23:01,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:01,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88216351] [2024-09-11 19:23:01,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:01,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 19:23:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:23:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:23:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88216351] [2024-09-11 19:23:01,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88216351] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:01,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:01,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:23:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803275693] [2024-09-11 19:23:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:23:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:23:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:01,827 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:23:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:01,890 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-11 19:23:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:23:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-11 19:23:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:01,891 INFO L225 Difference]: With dead ends: 45 [2024-09-11 19:23:01,891 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 19:23:01,892 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:23:01,893 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:01,893 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 19:23:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-11 19:23:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-11 19:23:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2024-09-11 19:23:01,904 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 17 [2024-09-11 19:23:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:01,905 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2024-09-11 19:23:01,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:23:01,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2024-09-11 19:23:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:01,906 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:01,906 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:01,906 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:23:01,906 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:01,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 905923334, now seen corresponding path program 1 times [2024-09-11 19:23:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477133910] [2024-09-11 19:23:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 19:23:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:23:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:23:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 19:23:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477133910] [2024-09-11 19:23:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477133910] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:01,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:23:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602655788] [2024-09-11 19:23:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,965 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:01,966 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 19:23:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:02,007 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2024-09-11 19:23:02,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:02,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-09-11 19:23:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:02,010 INFO L225 Difference]: With dead ends: 88 [2024-09-11 19:23:02,010 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 19:23:02,011 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:02,011 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:02,012 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 81 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 19:23:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-11 19:23:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-11 19:23:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-09-11 19:23:02,021 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 22 [2024-09-11 19:23:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:02,022 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-09-11 19:23:02,022 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 19:23:02,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-09-11 19:23:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-11 19:23:02,023 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:02,023 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-09-11 19:23:02,023 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:23:02,023 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:02,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1205745070, now seen corresponding path program 1 times [2024-09-11 19:23:02,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:02,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016247455] [2024-09-11 19:23:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 19:23:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:23:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:23:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:23:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:23:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 19:23:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,091 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:23:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-09-11 19:23:02,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:02,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016247455] [2024-09-11 19:23:02,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016247455] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:02,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:02,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:23:02,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215100064] [2024-09-11 19:23:02,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:02,095 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:23:02,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:02,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:23:02,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:23:02,096 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-11 19:23:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:02,132 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-09-11 19:23:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:23:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2024-09-11 19:23:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:02,133 INFO L225 Difference]: With dead ends: 61 [2024-09-11 19:23:02,134 INFO L226 Difference]: Without dead ends: 59 [2024-09-11 19:23:02,134 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:02,135 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:02,135 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-11 19:23:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-11 19:23:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-11 19:23:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2024-09-11 19:23:02,145 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 43 [2024-09-11 19:23:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:02,146 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2024-09-11 19:23:02,146 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-11 19:23:02,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-09-11 19:23:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-11 19:23:02,148 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:02,148 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:02,148 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:23:02,148 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:02,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash 296191259, now seen corresponding path program 1 times [2024-09-11 19:23:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760250681] [2024-09-11 19:23:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 19:23:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:23:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:23:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,334 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:23:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:23:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 19:23:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:23:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-11 19:23:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-11 19:23:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-11 19:23:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:23:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:23:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 19:23:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-11 19:23:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:02,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760250681] [2024-09-11 19:23:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760250681] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:02,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624715348] [2024-09-11 19:23:02,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:02,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:02,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:02,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:23:02,365 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 19:23:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-11 19:23:02,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-11 19:23:02,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-11 19:23:02,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624715348] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:02,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:02,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2024-09-11 19:23:02,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64164862] [2024-09-11 19:23:02,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:02,974 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 19:23:02,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:02,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 19:23:02,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-09-11 19:23:02,975 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2024-09-11 19:23:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:03,226 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2024-09-11 19:23:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 19:23:03,227 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 77 [2024-09-11 19:23:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:03,230 INFO L225 Difference]: With dead ends: 79 [2024-09-11 19:23:03,230 INFO L226 Difference]: Without dead ends: 77 [2024-09-11 19:23:03,230 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:23:03,232 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:03,233 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 248 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-11 19:23:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2024-09-11 19:23:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-11 19:23:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-09-11 19:23:03,259 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 77 [2024-09-11 19:23:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:03,260 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-09-11 19:23:03,260 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 11 states have call successors, (41), 3 states have call predecessors, (41), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2024-09-11 19:23:03,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-09-11 19:23:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-11 19:23:03,262 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:03,266 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:03,279 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:23:03,467 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:23:03,467 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:03,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash 359688270, now seen corresponding path program 2 times [2024-09-11 19:23:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:03,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955791771] [2024-09-11 19:23:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 19:23:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,609 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:23:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:23:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:23:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:23:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 19:23:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:23:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-11 19:23:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-11 19:23:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-11 19:23:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:23:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:23:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 19:23:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 19:23:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-09-11 19:23:03,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:03,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955791771] [2024-09-11 19:23:03,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955791771] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:03,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:03,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:23:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286147682] [2024-09-11 19:23:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:03,651 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:03,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:03,651 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-11 19:23:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:03,783 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2024-09-11 19:23:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:03,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2024-09-11 19:23:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:03,787 INFO L225 Difference]: With dead ends: 67 [2024-09-11 19:23:03,787 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:23:03,788 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:03,788 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:03,788 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:23:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:23:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:23:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:23:03,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2024-09-11 19:23:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:03,789 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:23:03,789 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-11 19:23:03,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:23:03,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:23:03,795 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:23:03,795 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 19:23:03,802 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:03,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:23:04,308 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:23:04,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:23:04 BoogieIcfgContainer [2024-09-11 19:23:04,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:23:04,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:23:04,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:23:04,326 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:23:04,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:00" (3/4) ... [2024-09-11 19:23:04,328 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:23:04,331 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 19:23:04,334 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-11 19:23:04,335 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 19:23:04,335 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:23:04,335 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:23:04,397 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:23:04,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:23:04,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:23:04,398 INFO L158 Benchmark]: Toolchain (without parser) took 4000.39ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 122.8MB in the beginning and 226.8MB in the end (delta: -104.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:23:04,398 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:23:04,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.78ms. Allocated memory is still 195.0MB. Free memory was 122.5MB in the beginning and 111.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 19:23:04,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.65ms. Allocated memory is still 195.0MB. Free memory was 111.2MB in the beginning and 109.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:23:04,399 INFO L158 Benchmark]: Boogie Preprocessor took 37.88ms. Allocated memory is still 195.0MB. Free memory was 109.9MB in the beginning and 108.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:23:04,399 INFO L158 Benchmark]: RCFGBuilder took 211.80ms. Allocated memory is still 195.0MB. Free memory was 108.1MB in the beginning and 96.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 19:23:04,399 INFO L158 Benchmark]: TraceAbstraction took 3424.44ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 95.9MB in the beginning and 231.0MB in the end (delta: -135.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-09-11 19:23:04,400 INFO L158 Benchmark]: Witness Printer took 71.74ms. Allocated memory is still 272.6MB. Free memory was 231.0MB in the beginning and 226.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:23:04,401 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 152.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.78ms. Allocated memory is still 195.0MB. Free memory was 122.5MB in the beginning and 111.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.65ms. Allocated memory is still 195.0MB. Free memory was 111.2MB in the beginning and 109.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.88ms. Allocated memory is still 195.0MB. Free memory was 109.9MB in the beginning and 108.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 211.80ms. Allocated memory is still 195.0MB. Free memory was 108.1MB in the beginning and 96.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3424.44ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 95.9MB in the beginning and 231.0MB in the end (delta: -135.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 71.74ms. Allocated memory is still 272.6MB. Free memory was 231.0MB in the beginning and 226.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 745 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 558 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 187 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 228 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1027 SizeOfPredicates, 1 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 1573/1599 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((2 == j) && (i == 1)) || ((i == 0) && (j == 0))) || ((((j <= 4) && (((long long) 2 * i) <= (6 + j))) && (2 <= j)) && ((2 + j) <= ((long long) 2 * i)))) || (((1 <= i) && (i <= 3)) && (j == 0))) || (((j <= 4) && (j == ((long long) 2 * i))) && (2 <= i))) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:23:04,424 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE