./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex-add.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-ex-add.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 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc --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:57,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:22:58,062 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,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:22:58,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:22:58,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:22:58,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:22:58,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:22:58,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:22:58,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:22:58,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:22:58,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:22:58,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:22:58,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:22:58,094 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:22:58,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:22:58,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:22:58,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:22:58,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:22:58,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:22:58,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:22:58,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:22:58,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:22:58,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:22:58,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:22:58,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:22:58,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:22:58,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:22:58,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:22:58,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:22:58,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:22:58,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:22:58,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:58,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:22:58,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:22:58,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:22:58,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:22:58,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:22:58,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:22:58,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:22:58,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:22:58,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:22:58,106 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 -> 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc 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,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:22:58,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:22:58,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:22:58,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:22:58,379 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:22:58,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2024-09-11 19:22:59,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:22:59,996 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:22:59,997 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2024-09-11 19:23:00,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/94d248db0/003b2348df634b58984ddea7272a9491/FLAGa54de5073 [2024-09-11 19:23:00,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/94d248db0/003b2348df634b58984ddea7272a9491 [2024-09-11 19:23:00,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:23:00,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:23:00,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:00,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:23:00,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:23:00,025 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,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a701df 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,026 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,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:23:00,189 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-ex-add.i[802,815] [2024-09-11 19:23:00,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:00,215 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:23:00,227 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-ex-add.i[802,815] [2024-09-11 19:23:00,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:00,250 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:23:00,253 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,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:00,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:00,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:23:00,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:23:00,263 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,271 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,290 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2024-09-11 19:23:00,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:00,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:23:00,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:23:00,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:23:00,300 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,300 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,301 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,312 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,315 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,316 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,318 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,322 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,322 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,323 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,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:23:00,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:23:00,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:23:00,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:23:00,326 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,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:23:00,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:00,369 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,373 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,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:23:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:23:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:23:00,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:23:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:23:00,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:23:00,489 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:23:00,491 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:23:00,657 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-11 19:23:00,658 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:23:00,689 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:23:00,689 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 19:23:00,710 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,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:23:00,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:23:00,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:23:00,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:23:00,726 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,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263b2260 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,729 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,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263b2260 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,731 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,734 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex-add.i [2024-09-11 19:23:00,769 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:23:00,770 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:23:00,832 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:23:00,842 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;@3d7fbe74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:23:00,843 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:23:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:23:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-11 19:23:00,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:00,855 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-11 19:23:00,856 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:00,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1018818160, now seen corresponding path program 1 times [2024-09-11 19:23:00,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:00,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801936353] [2024-09-11 19:23:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:00,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,180 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,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801936353] [2024-09-11 19:23:01,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801936353] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:01,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:01,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:23:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796760128] [2024-09-11 19:23:01,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:23:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:23:01,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:23:01,214 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:01,288 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2024-09-11 19:23:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:23:01,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-09-11 19:23:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:01,300 INFO L225 Difference]: With dead ends: 49 [2024-09-11 19:23:01,301 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 19:23:01,304 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:01,308 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:01,310 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 78 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 19:23:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-11 19:23:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:23:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-09-11 19:23:01,363 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 6 [2024-09-11 19:23:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:01,365 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-09-11 19:23:01,365 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-09-11 19:23:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:23:01,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:01,367 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:01,367 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:23:01,368 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:01,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1709322128, now seen corresponding path program 1 times [2024-09-11 19:23:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:01,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240883610] [2024-09-11 19:23:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,498 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,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240883610] [2024-09-11 19:23:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240883610] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:01,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:01,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:23:01,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721478256] [2024-09-11 19:23:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:23:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:23:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:23:01,505 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:01,559 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-09-11 19:23:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:23:01,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2024-09-11 19:23:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:01,561 INFO L225 Difference]: With dead ends: 32 [2024-09-11 19:23:01,561 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 19:23:01,562 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:01,563 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:01,563 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 85 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 19:23:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-11 19:23:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:23:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-11 19:23:01,582 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 11 [2024-09-11 19:23:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:01,583 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-11 19:23:01,583 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-11 19:23:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 19:23:01,587 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:01,587 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:01,588 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:23:01,588 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:01,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1725010344, now seen corresponding path program 1 times [2024-09-11 19:23:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420051350] [2024-09-11 19:23:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,685 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,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420051350] [2024-09-11 19:23:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420051350] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:01,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:01,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17655335] [2024-09-11 19:23:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:01,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:01,688 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:01,711 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2024-09-11 19:23:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:01,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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 20 [2024-09-11 19:23:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:01,714 INFO L225 Difference]: With dead ends: 72 [2024-09-11 19:23:01,714 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 19:23:01,715 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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,717 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:01,719 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 19:23:01,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-11 19:23:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:23:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2024-09-11 19:23:01,741 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 20 [2024-09-11 19:23:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:01,742 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2024-09-11 19:23:01,742 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2024-09-11 19:23:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:01,748 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:01,748 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:01,748 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:23:01,748 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:01,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash -781631511, now seen corresponding path program 1 times [2024-09-11 19:23:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:01,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013396856] [2024-09-11 19:23:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:01,807 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 7 [2024-09-11 19:23:01,816 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,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013396856] [2024-09-11 19:23:01,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013396856] 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,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:01,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994575819] [2024-09-11 19:23:01,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:01,827 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:01,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:01,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:01,829 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 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,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:01,859 INFO L93 Difference]: Finished difference Result 109 states and 155 transitions. [2024-09-11 19:23:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 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 22 [2024-09-11 19:23:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:01,862 INFO L225 Difference]: With dead ends: 109 [2024-09-11 19:23:01,862 INFO L226 Difference]: Without dead ends: 67 [2024-09-11 19:23:01,863 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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,864 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:01,867 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-11 19:23:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-11 19:23:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-11 19:23:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-09-11 19:23:01,889 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 22 [2024-09-11 19:23:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:01,889 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-09-11 19:23:01,890 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 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 L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-09-11 19:23:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-11 19:23:01,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:01,892 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:01,892 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:23:01,892 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:01,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1357088116, now seen corresponding path program 1 times [2024-09-11 19:23:01,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:01,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326859558] [2024-09-11 19:23:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:01,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:23:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:23:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:02,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:02,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326859558] [2024-09-11 19:23:02,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326859558] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:02,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548782189] [2024-09-11 19:23:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:02,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:02,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:02,029 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,030 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,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-11 19:23:02,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:02,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:02,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548782189] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:02,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:02,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-11 19:23:02,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247605608] [2024-09-11 19:23:02,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:02,240 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:23:02,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:23:02,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:02,241 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:23:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:02,330 INFO L93 Difference]: Finished difference Result 205 states and 311 transitions. [2024-09-11 19:23:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:02,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 37 [2024-09-11 19:23:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:02,333 INFO L225 Difference]: With dead ends: 205 [2024-09-11 19:23:02,333 INFO L226 Difference]: Without dead ends: 139 [2024-09-11 19:23:02,334 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:02,338 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:02,339 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 120 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-09-11 19:23:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-09-11 19:23:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 108 states have internal predecessors, (156), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-11 19:23:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 210 transitions. [2024-09-11 19:23:02,379 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 210 transitions. Word has length 37 [2024-09-11 19:23:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:02,380 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 210 transitions. [2024-09-11 19:23:02,380 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:23:02,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 210 transitions. [2024-09-11 19:23:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-11 19:23:02,382 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:02,382 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:02,402 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:02,583 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:02,583 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:02,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1935253147, now seen corresponding path program 1 times [2024-09-11 19:23:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650830547] [2024-09-11 19:23:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:23:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:23:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:02,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:02,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650830547] [2024-09-11 19:23:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650830547] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:02,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081754730] [2024-09-11 19:23:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:02,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:02,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:02,677 INFO L229 MonitoredProcess]: Starting monitored process 3 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,685 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 19:23:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:02,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-11 19:23:02,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:02,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:23:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081754730] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:02,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:02,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-11 19:23:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257453293] [2024-09-11 19:23:02,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:02,901 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:23:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:23:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:02,903 INFO L87 Difference]: Start difference. First operand 139 states and 210 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:23:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:03,001 INFO L93 Difference]: Finished difference Result 448 states and 701 transitions. [2024-09-11 19:23:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:03,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2024-09-11 19:23:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:03,008 INFO L225 Difference]: With dead ends: 448 [2024-09-11 19:23:03,008 INFO L226 Difference]: Without dead ends: 310 [2024-09-11 19:23:03,009 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:03,012 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:03,013 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 100 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-09-11 19:23:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-09-11 19:23:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 246 states have (on average 1.451219512195122) internal successors, (357), 246 states have internal predecessors, (357), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-09-11 19:23:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 477 transitions. [2024-09-11 19:23:03,085 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 477 transitions. Word has length 39 [2024-09-11 19:23:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:03,086 INFO L474 AbstractCegarLoop]: Abstraction has 310 states and 477 transitions. [2024-09-11 19:23:03,086 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:23:03,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 477 transitions. [2024-09-11 19:23:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-09-11 19:23:03,091 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:03,091 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2024-09-11 19:23:03,104 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:23:03,293 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:23:03,294 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:03,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1070414504, now seen corresponding path program 2 times [2024-09-11 19:23:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:03,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792989289] [2024-09-11 19:23:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:23:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:23:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 19:23:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:23:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 19:23:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 19:23:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 19:23:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 19:23:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-09-11 19:23:03,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792989289] [2024-09-11 19:23:03,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792989289] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:03,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:03,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:23:03,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923054285] [2024-09-11 19:23:03,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:03,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:03,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:03,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:03,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:03,548 INFO L87 Difference]: Start difference. First operand 310 states and 477 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:23:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:03,623 INFO L93 Difference]: Finished difference Result 316 states and 482 transitions. [2024-09-11 19:23:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2024-09-11 19:23:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:03,630 INFO L225 Difference]: With dead ends: 316 [2024-09-11 19:23:03,630 INFO L226 Difference]: Without dead ends: 314 [2024-09-11 19:23:03,631 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:03,631 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:03,631 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-11 19:23:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-09-11 19:23:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 249 states have (on average 1.4457831325301205) internal successors, (360), 249 states have internal predecessors, (360), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-09-11 19:23:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 480 transitions. [2024-09-11 19:23:03,679 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 480 transitions. Word has length 88 [2024-09-11 19:23:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:03,680 INFO L474 AbstractCegarLoop]: Abstraction has 314 states and 480 transitions. [2024-09-11 19:23:03,680 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:23:03,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 480 transitions. [2024-09-11 19:23:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-11 19:23:03,683 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:03,683 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-09-11 19:23:03,683 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 19:23:03,684 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:03,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -738283799, now seen corresponding path program 2 times [2024-09-11 19:23:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482199592] [2024-09-11 19:23:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 19:23:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:23:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:23:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:23:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 19:23:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:23:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 19:23:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 19:23:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 19:23:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 19:23:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-11 19:23:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482199592] [2024-09-11 19:23:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482199592] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:23:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904730933] [2024-09-11 19:23:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:03,875 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:03,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:03,880 INFO L87 Difference]: Start difference. First operand 314 states and 480 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:23:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:03,966 INFO L93 Difference]: Finished difference Result 314 states and 480 transitions. [2024-09-11 19:23:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:03,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 90 [2024-09-11 19:23:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:03,970 INFO L225 Difference]: With dead ends: 314 [2024-09-11 19:23:03,971 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:23:03,972 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:23:03,973 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:03,975 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:23:03,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:23:03,976 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,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:23:03,976 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2024-09-11 19:23:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:03,978 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:23:03,978 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:23:03,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:23:03,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:23:03,981 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:23:03,982 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 19:23:03,985 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-09-11 19:23:03,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:23:05,298 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:23:05,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:23:05 BoogieIcfgContainer [2024-09-11 19:23:05,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:23:05,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:23:05,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:23:05,311 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:23:05,312 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:05,314 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:23:05,317 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 19:23:05,320 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-11 19:23:05,320 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 19:23:05,320 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:23:05,320 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:23:05,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:23:05,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:23:05,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:23:05,408 INFO L158 Benchmark]: Toolchain (without parser) took 5389.16ms. Allocated memory was 138.4MB in the beginning and 222.3MB in the end (delta: 83.9MB). Free memory was 92.7MB in the beginning and 95.1MB in the end (delta: -2.4MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-09-11 19:23:05,408 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 138.4MB. Free memory was 100.1MB in the beginning and 100.1MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:23:05,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.21ms. Allocated memory is still 138.4MB. Free memory was 92.2MB in the beginning and 81.1MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 19:23:05,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 79.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:23:05,409 INFO L158 Benchmark]: Boogie Preprocessor took 32.93ms. Allocated memory is still 138.4MB. Free memory was 79.5MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:23:05,409 INFO L158 Benchmark]: RCFGBuilder took 385.33ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 77.5MB in the beginning and 148.1MB in the end (delta: -70.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-09-11 19:23:05,410 INFO L158 Benchmark]: TraceAbstraction took 4597.96ms. Allocated memory was 178.3MB in the beginning and 222.3MB in the end (delta: 44.0MB). Free memory was 147.4MB in the beginning and 100.3MB in the end (delta: 47.1MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2024-09-11 19:23:05,410 INFO L158 Benchmark]: Witness Printer took 96.08ms. Allocated memory is still 222.3MB. Free memory was 100.3MB in the beginning and 95.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 19:23:05,412 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.24ms. Allocated memory is still 138.4MB. Free memory was 100.1MB in the beginning and 100.1MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.21ms. Allocated memory is still 138.4MB. Free memory was 92.2MB in the beginning and 81.1MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 79.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.93ms. Allocated memory is still 138.4MB. Free memory was 79.5MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.33ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 77.5MB in the beginning and 148.1MB in the end (delta: -70.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4597.96ms. Allocated memory was 178.3MB in the beginning and 222.3MB in the end (delta: 44.0MB). Free memory was 147.4MB in the beginning and 100.3MB in the end (delta: 47.1MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. * Witness Printer took 96.08ms. Allocated memory is still 222.3MB. Free memory was 100.3MB in the beginning and 95.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 688 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 466 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 222 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 782/830 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: 18]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) - 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:05,446 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE