./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/nla-digbench-scaling/hard-ll_valuebound1.c -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 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:05:26,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:05:26,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:05:26,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:05:26,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:05:26,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:05:26,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:05:26,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:05:26,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:05:26,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:05:26,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:05:26,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:05:26,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:05:26,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:05:26,888 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:05:26,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:05:26,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:05:26,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:05:26,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:05:26,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:05:26,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:05:26,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:05:26,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:05:26,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:05:26,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:05:26,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:05:26,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:05:26,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:05:26,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:05:26,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:05:26,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:05:26,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:05:26,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:05:26,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:05:26,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:05:26,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:05:26,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:05:26,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:05:26,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:05:26,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:05:26,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:05:26,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:05:26,900 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 -> 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:05:27,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:05:27,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:05:27,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:05:27,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:05:27,235 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:05:27,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2024-09-25 11:05:28,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:05:29,000 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:05:29,001 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2024-09-25 11:05:29,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/74b70362d/ed0263a74c0e417e9cc6ad92f87003bf/FLAGa7084d82e [2024-09-25 11:05:29,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/74b70362d/ed0263a74c0e417e9cc6ad92f87003bf [2024-09-25 11:05:29,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:05:29,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:05:29,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:05:29,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:05:29,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:05:29,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a6bf443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29, skipping insertion in model container [2024-09-25 11:05:29,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:05:29,530 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2024-09-25 11:05:29,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:05:29,573 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:05:29,585 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2024-09-25 11:05:29,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:05:29,613 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:05:29,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29 WrapperNode [2024-09-25 11:05:29,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:05:29,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:05:29,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:05:29,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:05:29,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,640 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:05:29,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:05:29,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:05:29,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:05:29,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:05:29,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,667 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-25 11:05:29,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:05:29,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:05:29,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:05:29,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:05:29,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (1/1) ... [2024-09-25 11:05:29,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:05:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:29,721 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-25 11:05:29,724 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-25 11:05:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:05:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:05:29,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:05:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:05:29,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:05:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:05:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:05:29,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:05:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:05:29,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:05:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:05:29,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:05:29,843 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:05:29,846 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:05:30,026 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 11:05:30,029 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:05:30,045 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:05:30,046 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 11:05:30,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:05:30 BoogieIcfgContainer [2024-09-25 11:05:30,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:05:30,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:05:30,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:05:30,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:05:30,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:05:29" (1/3) ... [2024-09-25 11:05:30,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cda2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:05:30, skipping insertion in model container [2024-09-25 11:05:30,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:05:29" (2/3) ... [2024-09-25 11:05:30,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cda2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:05:30, skipping insertion in model container [2024-09-25 11:05:30,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:05:30" (3/3) ... [2024-09-25 11:05:30,053 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2024-09-25 11:05:30,067 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:05:30,067 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:05:30,117 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:05:30,126 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;@7462487f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:05:30,126 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:05:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 11:05:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:05:30,143 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:30,143 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:30,144 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:30,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:30,151 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-25 11:05:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:30,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722072370] [2024-09-25 11:05:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:05:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:05:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:05:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:05:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:05:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722072370] [2024-09-25 11:05:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722072370] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:05:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:05:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 11:05:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071258094] [2024-09-25 11:05:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:05:30,325 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 11:05:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:30,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 11:05:30,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:05:30,345 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:05:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:30,370 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-25 11:05:30,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 11:05:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-25 11:05:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:30,379 INFO L225 Difference]: With dead ends: 66 [2024-09-25 11:05:30,379 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:05:30,383 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:05:30,385 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:30,386 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:05:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:05:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 11:05:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:05:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-25 11:05:30,422 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-25 11:05:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:30,423 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-25 11:05:30,423 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:05:30,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-25 11:05:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:05:30,426 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:30,427 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:30,427 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:05:30,428 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:30,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-25 11:05:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809090545] [2024-09-25 11:05:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:30,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:05:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:05:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:05:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:05:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:05:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809090545] [2024-09-25 11:05:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809090545] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:05:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:05:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:05:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86347838] [2024-09-25 11:05:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:05:30,675 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:05:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:05:30,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:05:30,676 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:05:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:30,762 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-25 11:05:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:05:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-25 11:05:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:30,765 INFO L225 Difference]: With dead ends: 45 [2024-09-25 11:05:30,765 INFO L226 Difference]: Without dead ends: 43 [2024-09-25 11:05:30,766 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-25 11:05:30,768 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:30,771 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:05:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-25 11:05:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-25 11:05:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:05:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-25 11:05:30,788 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-25 11:05:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:30,789 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-25 11:05:30,789 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:05:30,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-25 11:05:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 11:05:30,791 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:30,791 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:30,791 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:05:30,791 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:30,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-25 11:05:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:30,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478664795] [2024-09-25 11:05:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:30,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:05:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:05:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:05:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:05:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:05:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:05:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:30,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478664795] [2024-09-25 11:05:30,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478664795] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:05:30,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:05:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:05:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914898696] [2024-09-25 11:05:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:05:30,983 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:05:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:30,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:05:30,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:05:30,986 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:05:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:31,066 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-25 11:05:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:05:31,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-25 11:05:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:31,068 INFO L225 Difference]: With dead ends: 49 [2024-09-25 11:05:31,068 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 11:05:31,068 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-25 11:05:31,070 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:31,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:05:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 11:05:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-25 11:05:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:05:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-25 11:05:31,080 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-25 11:05:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:31,080 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-25 11:05:31,080 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:05:31,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-25 11:05:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 11:05:31,082 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:31,082 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:31,082 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 11:05:31,083 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:31,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-25 11:05:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106875065] [2024-09-25 11:05:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:05:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781680036] [2024-09-25 11:05:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:31,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:31,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:31,110 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-25 11:05:31,112 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-25 11:05:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:31,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 11:05:31,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 11:05:31,314 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:05:31,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:31,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106875065] [2024-09-25 11:05:31,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:05:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781680036] [2024-09-25 11:05:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781680036] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:05:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:05:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:05:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111653213] [2024-09-25 11:05:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:05:31,318 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:05:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:05:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:05:31,323 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 11:05:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:31,409 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-25 11:05:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:05:31,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-25 11:05:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:31,411 INFO L225 Difference]: With dead ends: 66 [2024-09-25 11:05:31,412 INFO L226 Difference]: Without dead ends: 53 [2024-09-25 11:05:31,412 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-25 11:05:31,413 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:31,413 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:05:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-25 11:05:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-25 11:05:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-25 11:05:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-25 11:05:31,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-25 11:05:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:31,431 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-25 11:05:31,432 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 11:05:31,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-25 11:05:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-25 11:05:31,433 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:31,433 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:31,448 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:05:31,633 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:31,634 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:31,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-25 11:05:31,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:31,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392645056] [2024-09-25 11:05:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:05:31,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496837014] [2024-09-25 11:05:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:31,662 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-25 11:05:31,665 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-25 11:05:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:31,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-25 11:05:31,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 11:05:31,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:05:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 11:05:32,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:32,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392645056] [2024-09-25 11:05:32,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:05:32,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496837014] [2024-09-25 11:05:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496837014] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:05:32,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:05:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-25 11:05:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066814913] [2024-09-25 11:05:32,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:05:32,071 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 11:05:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 11:05:32,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-25 11:05:32,075 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 11:05:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:32,199 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-09-25 11:05:32,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:05:32,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-09-25 11:05:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:32,202 INFO L225 Difference]: With dead ends: 68 [2024-09-25 11:05:32,202 INFO L226 Difference]: Without dead ends: 66 [2024-09-25 11:05:32,203 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:05:32,203 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:32,204 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:05:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-25 11:05:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-25 11:05:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-25 11:05:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-09-25 11:05:32,232 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-09-25 11:05:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:32,233 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-09-25 11:05:32,233 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 11:05:32,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-09-25 11:05:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 11:05:32,234 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:32,234 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:32,252 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 11:05:32,439 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:32,440 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:32,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-25 11:05:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:32,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632864963] [2024-09-25 11:05:32,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:05:32,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009763878] [2024-09-25 11:05:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:32,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:32,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:32,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:05:32,471 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 11:05:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:32,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-25 11:05:32,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 11:05:32,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:05:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-25 11:05:32,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:32,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632864963] [2024-09-25 11:05:32,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:05:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009763878] [2024-09-25 11:05:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009763878] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 11:05:32,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:05:32,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-09-25 11:05:32,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737695646] [2024-09-25 11:05:32,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:05:32,833 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:05:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:05:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:05:32,834 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 11:05:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:32,910 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-09-25 11:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:05:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-09-25 11:05:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:32,913 INFO L225 Difference]: With dead ends: 73 [2024-09-25 11:05:32,916 INFO L226 Difference]: Without dead ends: 71 [2024-09-25 11:05:32,916 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:05:32,917 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:32,917 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:05:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-25 11:05:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-25 11:05:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-25 11:05:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-09-25 11:05:32,947 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-09-25 11:05:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:32,947 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-09-25 11:05:32,947 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 11:05:32,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-09-25 11:05:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-25 11:05:32,949 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:32,951 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:32,967 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 11:05:33,151 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 11:05:33,152 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:33,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-09-25 11:05:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:33,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356263018] [2024-09-25 11:05:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:05:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:05:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:05:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:05:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:05:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:05:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:05:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:05:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:05:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 11:05:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-25 11:05:33,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:33,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356263018] [2024-09-25 11:05:33,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356263018] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:05:33,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:05:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:05:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522459739] [2024-09-25 11:05:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:05:33,315 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:05:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:33,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:05:33,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:05:33,316 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-25 11:05:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:33,366 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-09-25 11:05:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:05:33,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-09-25 11:05:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:33,368 INFO L225 Difference]: With dead ends: 78 [2024-09-25 11:05:33,368 INFO L226 Difference]: Without dead ends: 66 [2024-09-25 11:05:33,368 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-25 11:05:33,369 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:33,369 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:05:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-25 11:05:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-25 11:05:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-25 11:05:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-09-25 11:05:33,398 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-09-25 11:05:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:33,398 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-09-25 11:05:33,398 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-25 11:05:33,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-09-25 11:05:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-25 11:05:33,400 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:33,400 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:33,401 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 11:05:33,401 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:33,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-25 11:05:33,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:33,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840046388] [2024-09-25 11:05:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:05:33,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034892660] [2024-09-25 11:05:33,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:33,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:33,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:33,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:05:33,441 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:05:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:33,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-25 11:05:33,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-25 11:05:33,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:05:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-25 11:05:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840046388] [2024-09-25 11:05:35,897 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:05:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034892660] [2024-09-25 11:05:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034892660] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:05:35,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:05:35,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-25 11:05:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048403474] [2024-09-25 11:05:35,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:05:35,908 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 11:05:35,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 11:05:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-09-25 11:05:35,911 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 10 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-09-25 11:05:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:36,379 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-09-25 11:05:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 11:05:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 10 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 74 [2024-09-25 11:05:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:36,381 INFO L225 Difference]: With dead ends: 122 [2024-09-25 11:05:36,382 INFO L226 Difference]: Without dead ends: 99 [2024-09-25 11:05:36,382 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-09-25 11:05:36,383 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:36,383 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 329 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:05:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-25 11:05:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2024-09-25 11:05:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 57 states have internal predecessors, (61), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-25 11:05:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-09-25 11:05:36,406 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 74 [2024-09-25 11:05:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:36,407 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-09-25 11:05:36,407 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 10 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-09-25 11:05:36,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-09-25 11:05:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-25 11:05:36,409 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:36,409 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:36,426 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:05:36,613 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:36,614 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:36,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-09-25 11:05:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565549575] [2024-09-25 11:05:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:05:36,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206493340] [2024-09-25 11:05:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:36,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:36,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:36,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:05:36,656 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:05:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:36,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-25 11:05:36,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-25 11:05:37,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:05:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-25 11:05:37,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565549575] [2024-09-25 11:05:37,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:05:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206493340] [2024-09-25 11:05:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206493340] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:05:37,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:05:37,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-09-25 11:05:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850443672] [2024-09-25 11:05:37,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:05:37,781 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 11:05:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 11:05:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-09-25 11:05:37,782 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 12 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 10 states have call successors, (26) [2024-09-25 11:05:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:38,716 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2024-09-25 11:05:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 11:05:38,717 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 12 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 10 states have call successors, (26) Word has length 85 [2024-09-25 11:05:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:38,719 INFO L225 Difference]: With dead ends: 133 [2024-09-25 11:05:38,719 INFO L226 Difference]: Without dead ends: 129 [2024-09-25 11:05:38,720 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2024-09-25 11:05:38,720 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:38,720 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 344 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 11:05:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-25 11:05:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2024-09-25 11:05:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-25 11:05:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-09-25 11:05:38,756 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 85 [2024-09-25 11:05:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:38,757 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-09-25 11:05:38,757 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 12 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 10 states have call successors, (26) [2024-09-25 11:05:38,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-09-25 11:05:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-25 11:05:38,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:38,759 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:38,775 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 11:05:38,963 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:38,964 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:38,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-09-25 11:05:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:38,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4131651] [2024-09-25 11:05:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:05:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:05:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:05:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,073 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:05:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:05:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:05:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:05:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:05:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:05:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:05:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 11:05:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 11:05:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-25 11:05:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-25 11:05:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-25 11:05:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-25 11:05:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-25 11:05:39,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:39,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4131651] [2024-09-25 11:05:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4131651] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:05:39,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193547896] [2024-09-25 11:05:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:39,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:39,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:39,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:05:39,118 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 11:05:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 11:05:39,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-25 11:05:39,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:05:39,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193547896] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:05:39,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:05:39,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-25 11:05:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801369580] [2024-09-25 11:05:39,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:05:39,211 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:05:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:05:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:05:39,212 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-25 11:05:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:39,283 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2024-09-25 11:05:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:05:39,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 94 [2024-09-25 11:05:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:39,285 INFO L225 Difference]: With dead ends: 132 [2024-09-25 11:05:39,286 INFO L226 Difference]: Without dead ends: 120 [2024-09-25 11:05:39,286 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:05:39,286 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:39,287 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 98 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:05:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-25 11:05:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-09-25 11:05:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 73 states have internal predecessors, (83), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-09-25 11:05:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-09-25 11:05:39,322 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 94 [2024-09-25 11:05:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:39,323 INFO L474 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-09-25 11:05:39,323 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-25 11:05:39,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-09-25 11:05:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-09-25 11:05:39,325 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:39,325 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:39,344 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 11:05:39,525 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 11:05:39,526 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:39,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1544157164, now seen corresponding path program 2 times [2024-09-25 11:05:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105170866] [2024-09-25 11:05:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:05:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:05:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:05:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,755 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:05:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:05:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:05:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,765 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:05:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:05:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,775 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:05:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:05:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,785 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 11:05:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 11:05:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 11:05:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-25 11:05:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-25 11:05:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-25 11:05:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-25 11:05:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105170866] [2024-09-25 11:05:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105170866] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:05:39,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268193523] [2024-09-25 11:05:39,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:05:39,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:39,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:39,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:05:39,812 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 11:05:39,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:05:39,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:05:39,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 11:05:39,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 109 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-09-25 11:05:39,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:05:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-25 11:05:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268193523] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:05:40,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:05:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-25 11:05:40,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252661251] [2024-09-25 11:05:40,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:05:40,003 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:05:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:40,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:05:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:05:40,004 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2024-09-25 11:05:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:40,081 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2024-09-25 11:05:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 11:05:40,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 98 [2024-09-25 11:05:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:40,083 INFO L225 Difference]: With dead ends: 146 [2024-09-25 11:05:40,083 INFO L226 Difference]: Without dead ends: 101 [2024-09-25 11:05:40,083 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:05:40,084 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:40,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:05:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-25 11:05:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-09-25 11:05:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 61 states have internal predecessors, (67), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-25 11:05:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2024-09-25 11:05:40,113 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 98 [2024-09-25 11:05:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:40,113 INFO L474 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2024-09-25 11:05:40,113 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2024-09-25 11:05:40,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2024-09-25 11:05:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-25 11:05:40,114 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:40,114 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:40,133 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 11:05:40,315 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:40,315 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:40,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1973122394, now seen corresponding path program 3 times [2024-09-25 11:05:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336813754] [2024-09-25 11:05:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:05:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:05:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:05:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:05:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:05:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:05:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:05:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:05:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:05:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:05:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 11:05:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 11:05:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-25 11:05:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-25 11:05:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-25 11:05:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-25 11:05:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-25 11:05:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-25 11:05:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,755 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-25 11:05:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-09-25 11:05:40,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:40,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336813754] [2024-09-25 11:05:40,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336813754] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:05:40,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642830539] [2024-09-25 11:05:40,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:05:40,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:40,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:40,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:05:40,761 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 11:05:40,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 11:05:40,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:05:40,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 11:05:40,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 246 proven. 3 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-09-25 11:05:40,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:05:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-09-25 11:05:41,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642830539] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:05:41,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:05:41,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2024-09-25 11:05:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720697950] [2024-09-25 11:05:41,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:05:41,124 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 11:05:41,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:41,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 11:05:41,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-09-25 11:05:41,125 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 11 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 13 states have call predecessors, (38), 11 states have call successors, (38) [2024-09-25 11:05:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:41,244 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-25 11:05:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:05:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 11 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 13 states have call predecessors, (38), 11 states have call successors, (38) Word has length 115 [2024-09-25 11:05:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:41,246 INFO L225 Difference]: With dead ends: 105 [2024-09-25 11:05:41,246 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:05:41,246 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-09-25 11:05:41,247 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:41,247 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 176 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:05:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:05:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:05:41,248 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-25 11:05:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:05:41,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2024-09-25 11:05:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:41,248 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:05:41,249 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 11 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (38), 13 states have call predecessors, (38), 11 states have call successors, (38) [2024-09-25 11:05:41,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:05:41,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:05:41,251 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:05:41,268 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 11:05:41,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:41,456 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:41,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:05:42,054 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:05:42,075 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:05:42,078 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:05:42,078 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:05:42,078 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:05:42,078 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:05:42,078 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:05:42,078 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:05:42,079 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:05:42,080 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:05:42,080 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:05:42,080 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:05:42,081 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:05:42,081 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:05:42,081 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:05:42,081 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:05:42,081 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:05:42,082 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:05:42,082 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:05:42,083 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:05:42,083 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:05:42,083 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:05:42,083 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:05:42,083 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:05:42,084 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:05:42,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:05:42 BoogieIcfgContainer [2024-09-25 11:05:42,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:05:42,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:05:42,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:05:42,086 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:05:42,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:05:30" (3/4) ... [2024-09-25 11:05:42,088 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:05:42,142 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:05:42,142 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:05:42,143 INFO L158 Benchmark]: Toolchain (without parser) took 12772.77ms. Allocated memory was 77.6MB in the beginning and 197.1MB in the end (delta: 119.5MB). Free memory was 53.3MB in the beginning and 124.0MB in the end (delta: -70.7MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2024-09-25 11:05:42,143 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:05:42,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.51ms. Allocated memory is still 77.6MB. Free memory was 53.2MB in the beginning and 41.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 11:05:42,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.19ms. Allocated memory is still 77.6MB. Free memory was 41.4MB in the beginning and 40.4MB in the end (delta: 998.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:05:42,144 INFO L158 Benchmark]: Boogie Preprocessor took 41.66ms. Allocated memory is still 77.6MB. Free memory was 40.4MB in the beginning and 38.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:05:42,145 INFO L158 Benchmark]: RCFGBuilder took 362.98ms. Allocated memory is still 77.6MB. Free memory was 38.6MB in the beginning and 46.9MB in the end (delta: -8.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-09-25 11:05:42,145 INFO L158 Benchmark]: TraceAbstraction took 12036.90ms. Allocated memory was 77.6MB in the beginning and 197.1MB in the end (delta: 119.5MB). Free memory was 46.2MB in the beginning and 127.1MB in the end (delta: -80.9MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2024-09-25 11:05:42,146 INFO L158 Benchmark]: Witness Printer took 57.10ms. Allocated memory is still 197.1MB. Free memory was 127.1MB in the beginning and 124.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 11:05:42,147 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.16ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.51ms. Allocated memory is still 77.6MB. Free memory was 53.2MB in the beginning and 41.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.19ms. Allocated memory is still 77.6MB. Free memory was 41.4MB in the beginning and 40.4MB in the end (delta: 998.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.66ms. Allocated memory is still 77.6MB. Free memory was 40.4MB in the beginning and 38.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 362.98ms. Allocated memory is still 77.6MB. Free memory was 38.6MB in the beginning and 46.9MB in the end (delta: -8.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12036.90ms. Allocated memory was 77.6MB in the beginning and 197.1MB in the end (delta: 119.5MB). Free memory was 46.2MB in the beginning and 127.1MB in the end (delta: -80.9MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. * Witness Printer took 57.10ms. Allocated memory is still 197.1MB. Free memory was 127.1MB in the beginning and 124.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 17]: 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 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 1925 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1465 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1013 IncrementalHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 460 mSDtfsCounter, 1013 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1275 GetRequests, 1159 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1348 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 5858 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1223 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 4005/4124 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: 46]: Loop Invariant Derived loop invariant: ((((((((B == 1) && (p == 2)) && (r == 1)) && (A == 1)) && (d == 2)) && (q == 0)) || ((((((B == 1) && (r == 0)) && (A == 1)) && (d == 1)) && (q == 1)) && (p == 1))) || ((((d == B) && (A == r)) && (q == 0)) && (p == 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((B == 1) && (p == 2)) && (r == 1)) && (A == 1)) && (d == 2)) && (q == 0)) || ((((((B == 1) && (A == r)) && (A <= 1)) && (d == 1)) && (q == 0)) && (p == 1))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:05:42,174 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE