./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.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 174cfd8cb6426614b32355f584844d4fc6265ba8fd3c3cda6c788ade64de4fc0 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:10:16,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:10:16,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:10:16,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:10:16,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:10:16,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:10:16,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:10:16,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:10:16,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:10:16,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:10:16,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:10:16,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:10:16,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:10:16,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:10:16,858 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:10:16,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:10:16,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:10:16,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:10:16,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:10:16,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:10:16,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:10:16,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:10:16,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:10:16,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:10:16,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:10:16,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:10:16,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:10:16,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:10:16,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:10:16,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:10:16,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:10:16,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:10:16,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:10:16,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:10:16,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:10:16,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:10:16,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:10:16,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:10:16,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:10:16,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:10:16,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:10:16,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:10:16,870 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 -> 174cfd8cb6426614b32355f584844d4fc6265ba8fd3c3cda6c788ade64de4fc0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:10:17,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:10:17,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:10:17,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:10:17,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:10:17,178 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:10:17,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c [2024-09-11 20:10:18,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:10:18,732 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:10:18,733 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c [2024-09-11 20:10:18,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/541b49cda/e46c7dfc0f274571a274b0b689118729/FLAGdc8dd0496 [2024-09-11 20:10:19,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/541b49cda/e46c7dfc0f274571a274b0b689118729 [2024-09-11 20:10:19,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:10:19,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:10:19,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:10:19,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:10:19,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:10:19,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105e05cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19, skipping insertion in model container [2024-09-11 20:10:19,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:10:19,304 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c[526,539] [2024-09-11 20:10:19,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:10:19,328 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:10:19,340 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound10.c[526,539] [2024-09-11 20:10:19,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:10:19,373 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:10:19,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19 WrapperNode [2024-09-11 20:10:19,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:10:19,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:10:19,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:10:19,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:10:19,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,407 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-09-11 20:10:19,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:10:19,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:10:19,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:10:19,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:10:19,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,434 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-11 20:10:19,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:10:19,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:10:19,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:10:19,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:10:19,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (1/1) ... [2024-09-11 20:10:19,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:10:19,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:19,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:10:19,483 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:10:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:10:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:10:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:10:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:10:19,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:10:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:10:19,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:10:19,582 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:10:19,583 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:10:19,715 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-11 20:10:19,716 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:10:19,743 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:10:19,743 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 20:10:19,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:10:19 BoogieIcfgContainer [2024-09-11 20:10:19,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:10:19,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:10:19,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:10:19,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:10:19,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:10:19" (1/3) ... [2024-09-11 20:10:19,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657071cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:10:19, skipping insertion in model container [2024-09-11 20:10:19,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:19" (2/3) ... [2024-09-11 20:10:19,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657071cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:10:19, skipping insertion in model container [2024-09-11 20:10:19,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:10:19" (3/3) ... [2024-09-11 20:10:19,754 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound10.c [2024-09-11 20:10:19,769 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:10:19,769 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:10:19,821 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:10:19,826 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;@df243fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:10:19,827 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:10:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:10:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:10:19,835 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:19,836 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:19,836 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:19,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1830609328, now seen corresponding path program 1 times [2024-09-11 20:10:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:19,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424621215] [2024-09-11 20:10:19,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:10:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424621215] [2024-09-11 20:10:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424621215] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:19,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:19,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:10:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573685201] [2024-09-11 20:10:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:19,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:10:19,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:10:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:10:20,031 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:10:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:20,067 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. [2024-09-11 20:10:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:10:20,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-09-11 20:10:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:20,075 INFO L225 Difference]: With dead ends: 44 [2024-09-11 20:10:20,075 INFO L226 Difference]: Without dead ends: 21 [2024-09-11 20:10:20,078 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 20:10:20,081 INFO L434 NwaCegarLoop]: 29 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, 29 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-11 20:10:20,083 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:10:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-11 20:10:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-11 20:10:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:10:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2024-09-11 20:10:20,113 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 8 [2024-09-11 20:10:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:20,114 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2024-09-11 20:10:20,114 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:10:20,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-09-11 20:10:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:10:20,116 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:20,116 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:20,116 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:10:20,116 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:20,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash -55601966, now seen corresponding path program 1 times [2024-09-11 20:10:20,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:20,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776762886] [2024-09-11 20:10:20,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:20,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:10:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776762886] [2024-09-11 20:10:20,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776762886] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:20,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:20,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395421105] [2024-09-11 20:10:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:20,306 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:20,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:20,307 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:10:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:20,374 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2024-09-11 20:10:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-09-11 20:10:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:20,376 INFO L225 Difference]: With dead ends: 34 [2024-09-11 20:10:20,376 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 20:10:20,377 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:10:20,378 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:20,379 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:10:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 20:10:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-09-11 20:10:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:10:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-09-11 20:10:20,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 8 [2024-09-11 20:10:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:20,390 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-09-11 20:10:20,390 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:10:20,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-09-11 20:10:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 20:10:20,392 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:20,392 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:20,392 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:10:20,392 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:20,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1587104181, now seen corresponding path program 1 times [2024-09-11 20:10:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213929971] [2024-09-11 20:10:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:20,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:10:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213929971] [2024-09-11 20:10:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213929971] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:20,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:20,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903561332] [2024-09-11 20:10:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:20,532 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:20,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:20,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:20,534 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:10:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:20,595 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-11 20:10:20,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:20,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-11 20:10:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:20,596 INFO L225 Difference]: With dead ends: 38 [2024-09-11 20:10:20,597 INFO L226 Difference]: Without dead ends: 36 [2024-09-11 20:10:20,597 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:10:20,598 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:20,599 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:10:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-11 20:10:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-09-11 20:10:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:10:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-11 20:10:20,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 13 [2024-09-11 20:10:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:20,621 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-11 20:10:20,621 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:10:20,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-11 20:10:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 20:10:20,623 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:20,623 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:20,623 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:10:20,624 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:20,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1972613170, now seen corresponding path program 1 times [2024-09-11 20:10:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877604226] [2024-09-11 20:10:20,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954441393] [2024-09-11 20:10:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:20,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:20,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:10:20,662 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:10:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:20,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 20:10:20,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:10:20,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:10:20,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:20,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877604226] [2024-09-11 20:10:20,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:20,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954441393] [2024-09-11 20:10:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954441393] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:20,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:20,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825071500] [2024-09-11 20:10:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:20,852 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:20,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:20,853 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:10:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:20,929 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2024-09-11 20:10:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:20,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-11 20:10:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:20,931 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:10:20,931 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 20:10:20,932 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:10:20,933 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:20,937 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:10:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 20:10:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 20:10:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 20:10:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-09-11 20:10:20,950 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 18 [2024-09-11 20:10:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:20,950 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-09-11 20:10:20,951 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:10:20,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-09-11 20:10:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 20:10:20,953 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:20,954 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:20,966 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:10:21,156 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-11 20:10:21,157 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:21,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1810344840, now seen corresponding path program 1 times [2024-09-11 20:10:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:21,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966593847] [2024-09-11 20:10:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:21,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590076329] [2024-09-11 20:10:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:21,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:21,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:21,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:10:21,185 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:10:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:21,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 20:10:21,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:10:21,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:10:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966593847] [2024-09-11 20:10:21,525 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590076329] [2024-09-11 20:10:21,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590076329] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:21,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:21,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 20:10:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715445331] [2024-09-11 20:10:21,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:21,527 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:10:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:10:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:10:21,528 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:10:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:21,649 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-09-11 20:10:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:10:21,650 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2024-09-11 20:10:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:21,651 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:10:21,651 INFO L226 Difference]: Without dead ends: 53 [2024-09-11 20:10:21,651 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 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-11 20:10:21,652 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:21,652 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 79 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:10:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-11 20:10:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-09-11 20:10:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:10:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-09-11 20:10:21,672 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 25 [2024-09-11 20:10:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:21,672 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-09-11 20:10:21,673 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:10:21,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-09-11 20:10:21,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:10:21,678 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:21,678 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:21,697 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:10:21,878 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-11 20:10:21,879 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:21,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash -447891575, now seen corresponding path program 1 times [2024-09-11 20:10:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:21,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033476583] [2024-09-11 20:10:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:21,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199986401] [2024-09-11 20:10:21,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:21,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:21,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:21,898 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-11 20:10:21,903 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-11 20:10:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:21,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 20:10:21,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-11 20:10:22,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-11 20:10:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:22,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033476583] [2024-09-11 20:10:22,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:22,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199986401] [2024-09-11 20:10:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199986401] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:10:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 20:10:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124969413] [2024-09-11 20:10:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:22,213 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:22,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:22,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:10:22,215 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:10:23,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:10:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:23,817 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2024-09-11 20:10:23,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:23,818 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-09-11 20:10:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:23,823 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:10:23,823 INFO L226 Difference]: Without dead ends: 60 [2024-09-11 20:10:23,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:10:23,824 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:23,826 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-09-11 20:10:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-11 20:10:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-11 20:10:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 20:10:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-09-11 20:10:23,847 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 35 [2024-09-11 20:10:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:23,850 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-09-11 20:10:23,850 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), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:10:23,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-09-11 20:10:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-11 20:10:23,852 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:23,852 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:23,870 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:10:24,052 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-11 20:10:24,053 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:24,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1669992559, now seen corresponding path program 1 times [2024-09-11 20:10:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:24,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848578346] [2024-09-11 20:10:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:24,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:24,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:10:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:24,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:10:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:24,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:10:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:24,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:10:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:24,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 20:10:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-11 20:10:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848578346] [2024-09-11 20:10:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848578346] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:24,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872853782] [2024-09-11 20:10:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:24,190 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:24,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:24,192 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-11 20:10:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:24,250 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2024-09-11 20:10:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:24,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-09-11 20:10:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:24,254 INFO L225 Difference]: With dead ends: 67 [2024-09-11 20:10:24,254 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 20:10:24,255 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:10:24,256 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:24,256 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:10:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 20:10:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-11 20:10:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:10:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-09-11 20:10:24,269 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 41 [2024-09-11 20:10:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:24,269 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-09-11 20:10:24,269 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-11 20:10:24,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-09-11 20:10:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 20:10:24,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:24,271 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:24,271 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 20:10:24,272 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:24,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1460518785, now seen corresponding path program 1 times [2024-09-11 20:10:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310559200] [2024-09-11 20:10:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300924255] [2024-09-11 20:10:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:24,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:24,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:24,305 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-11 20:10:24,307 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-11 20:10:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:24,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-11 20:10:24,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-11 20:10:24,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-11 20:10:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310559200] [2024-09-11 20:10:25,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300924255] [2024-09-11 20:10:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300924255] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:25,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-09-11 20:10:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806727587] [2024-09-11 20:10:25,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:25,902 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:10:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:10:25,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:10:25,904 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 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-11 20:10:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:26,534 INFO L93 Difference]: Finished difference Result 130 states and 175 transitions. [2024-09-11 20:10:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:10:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 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 55 [2024-09-11 20:10:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:26,536 INFO L225 Difference]: With dead ends: 130 [2024-09-11 20:10:26,536 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 20:10:26,538 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:10:26,540 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:26,541 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 171 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:10:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 20:10:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-09-11 20:10:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 68 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-11 20:10:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2024-09-11 20:10:26,588 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 55 [2024-09-11 20:10:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:26,589 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2024-09-11 20:10:26,589 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 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-11 20:10:26,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2024-09-11 20:10:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-09-11 20:10:26,593 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:26,593 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:26,613 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:10:26,797 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-11 20:10:26,798 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:26,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -814878683, now seen corresponding path program 1 times [2024-09-11 20:10:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752741794] [2024-09-11 20:10:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:26,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006256607] [2024-09-11 20:10:26,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:26,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:26,844 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-11 20:10:26,846 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-11 20:10:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:26,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-11 20:10:26,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-11 20:10:27,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-11 20:10:27,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:27,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752741794] [2024-09-11 20:10:27,834 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:27,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006256607] [2024-09-11 20:10:27,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006256607] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:27,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:27,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2024-09-11 20:10:27,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220470519] [2024-09-11 20:10:27,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:27,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:10:27,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:27,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:10:27,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:10:27,838 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 11 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2024-09-11 20:10:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:28,445 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2024-09-11 20:10:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 20:10:28,445 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 11 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 66 [2024-09-11 20:10:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:28,448 INFO L225 Difference]: With dead ends: 170 [2024-09-11 20:10:28,448 INFO L226 Difference]: Without dead ends: 125 [2024-09-11 20:10:28,449 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:10:28,449 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:28,450 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 174 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:10:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-09-11 20:10:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 100. [2024-09-11 20:10:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 65 states have internal predecessors, (71), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-11 20:10:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2024-09-11 20:10:28,486 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 66 [2024-09-11 20:10:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:28,486 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2024-09-11 20:10:28,486 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 11 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2024-09-11 20:10:28,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2024-09-11 20:10:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-11 20:10:28,488 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:28,488 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 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] [2024-09-11 20:10:28,507 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 20:10:28,688 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-11 20:10:28,689 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:28,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1399001704, now seen corresponding path program 1 times [2024-09-11 20:10:28,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:28,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926050924] [2024-09-11 20:10:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:10:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:10:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:10:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:10:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:10:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:10:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:10:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-11 20:10:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-11 20:10:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-11 20:10:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:10:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926050924] [2024-09-11 20:10:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926050924] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:29,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031525639] [2024-09-11 20:10:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:29,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:29,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:29,081 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-11 20:10:29,082 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-11 20:10:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:29,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-11 20:10:29,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:10:29,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:10:29,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031525639] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:29,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:10:29,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-09-11 20:10:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184002085] [2024-09-11 20:10:29,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:29,647 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:10:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:29,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:10:29,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:10:29,648 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-09-11 20:10:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:29,848 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2024-09-11 20:10:29,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:10:29,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 71 [2024-09-11 20:10:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:29,850 INFO L225 Difference]: With dead ends: 119 [2024-09-11 20:10:29,850 INFO L226 Difference]: Without dead ends: 92 [2024-09-11 20:10:29,851 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:10:29,851 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:29,852 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 198 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:10:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-11 20:10:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-09-11 20:10:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 60 states have internal predecessors, (64), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-11 20:10:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-09-11 20:10:29,877 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 71 [2024-09-11 20:10:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:29,878 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-09-11 20:10:29,878 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-09-11 20:10:29,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-09-11 20:10:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-11 20:10:29,879 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:29,879 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:29,895 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-11 20:10:30,083 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-11 20:10:30,084 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:30,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2065528550, now seen corresponding path program 1 times [2024-09-11 20:10:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:30,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081539668] [2024-09-11 20:10:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:10:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:10:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:10:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:10:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:10:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:10:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:10:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:10:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:10:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:10:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:10:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 20:10:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-09-11 20:10:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081539668] [2024-09-11 20:10:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081539668] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041767448] [2024-09-11 20:10:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:30,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:30,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:30,295 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-11 20:10:30,296 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-11 20:10:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:30,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:10:30,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-09-11 20:10:30,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:10:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041767448] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:10:30,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2024-09-11 20:10:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2774496] [2024-09-11 20:10:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:30,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:10:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:10:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:10:30,480 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-11 20:10:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:30,590 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2024-09-11 20:10:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:10:30,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 85 [2024-09-11 20:10:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:30,591 INFO L225 Difference]: With dead ends: 124 [2024-09-11 20:10:30,592 INFO L226 Difference]: Without dead ends: 87 [2024-09-11 20:10:30,592 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:10:30,593 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:30,593 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 111 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:10:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-11 20:10:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2024-09-11 20:10:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 51 states have internal predecessors, (53), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-11 20:10:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-09-11 20:10:30,616 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 85 [2024-09-11 20:10:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:30,616 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-09-11 20:10:30,617 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-11 20:10:30,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-09-11 20:10:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-11 20:10:30,618 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:30,618 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:30,635 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:10:30,818 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-11 20:10:30,819 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:30,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash -376584808, now seen corresponding path program 2 times [2024-09-11 20:10:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199536606] [2024-09-11 20:10:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:30,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445046319] [2024-09-11 20:10:30,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:10:30,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:30,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:30,856 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-11 20:10:30,857 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-11 20:10:30,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:10:30,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:10:30,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-11 20:10:30,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-11 20:10:31,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-11 20:10:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:49,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199536606] [2024-09-11 20:10:49,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:49,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445046319] [2024-09-11 20:10:49,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445046319] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:49,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:49,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-09-11 20:10:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493799277] [2024-09-11 20:10:49,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:49,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-11 20:10:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:49,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-11 20:10:49,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:10:49,689 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2024-09-11 20:11:01,756 WARN L293 SmtUtils]: Spent 11.64s on a formula simplification. DAG size of input: 177 DAG size of output: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:11:05,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:19,372 WARN L293 SmtUtils]: Spent 11.21s on a formula simplification. DAG size of input: 158 DAG size of output: 102 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:11:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:20,676 INFO L93 Difference]: Finished difference Result 156 states and 199 transitions. [2024-09-11 20:11:20,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:11:20,677 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 85 [2024-09-11 20:11:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:20,679 INFO L225 Difference]: With dead ends: 156 [2024-09-11 20:11:20,679 INFO L226 Difference]: Without dead ends: 137 [2024-09-11 20:11:20,679 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:11:20,681 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:20,681 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 311 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-09-11 20:11:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-09-11 20:11:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-09-11 20:11:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 87 states have internal predecessors, (93), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) [2024-09-11 20:11:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 168 transitions. [2024-09-11 20:11:20,740 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 168 transitions. Word has length 85 [2024-09-11 20:11:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:20,740 INFO L474 AbstractCegarLoop]: Abstraction has 133 states and 168 transitions. [2024-09-11 20:11:20,741 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2024-09-11 20:11:20,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 168 transitions. [2024-09-11 20:11:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-09-11 20:11:20,742 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:20,742 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:20,758 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 20:11:20,946 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-11 20:11:20,947 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:20,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1552559470, now seen corresponding path program 1 times [2024-09-11 20:11:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:20,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633788748] [2024-09-11 20:11:20,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:20,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:20,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868339570] [2024-09-11 20:11:20,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:20,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:20,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:20,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:20,979 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:11:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:21,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-11 20:11:21,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-11 20:11:21,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-11 20:11:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633788748] [2024-09-11 20:11:22,539 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868339570] [2024-09-11 20:11:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868339570] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:22,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-09-11 20:11:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436658742] [2024-09-11 20:11:22,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:22,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 20:11:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:22,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 20:11:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:11:22,541 INFO L87 Difference]: Start difference. First operand 133 states and 168 transitions. Second operand has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-09-11 20:11:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:23,426 INFO L93 Difference]: Finished difference Result 183 states and 247 transitions. [2024-09-11 20:11:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-11 20:11:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) Word has length 96 [2024-09-11 20:11:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:23,428 INFO L225 Difference]: With dead ends: 183 [2024-09-11 20:11:23,428 INFO L226 Difference]: Without dead ends: 181 [2024-09-11 20:11:23,429 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2024-09-11 20:11:23,429 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:23,430 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 280 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-11 20:11:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-09-11 20:11:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2024-09-11 20:11:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 99 states have (on average 1.202020202020202) internal successors, (119), 105 states have internal predecessors, (119), 48 states have call successors, (48), 15 states have call predecessors, (48), 15 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2024-09-11 20:11:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 214 transitions. [2024-09-11 20:11:23,516 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 214 transitions. Word has length 96 [2024-09-11 20:11:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:23,517 INFO L474 AbstractCegarLoop]: Abstraction has 163 states and 214 transitions. [2024-09-11 20:11:23,517 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-09-11 20:11:23,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2024-09-11 20:11:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-11 20:11:23,519 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:23,519 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:23,535 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-11 20:11:23,722 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 20:11:23,723 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:23,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2060413457, now seen corresponding path program 1 times [2024-09-11 20:11:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:23,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025708559] [2024-09-11 20:11:23,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,100 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:11:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:11:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:11:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:11:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 20:11:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-11 20:11:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-11 20:11:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-11 20:11:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-11 20:11:24,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025708559] [2024-09-11 20:11:24,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025708559] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454389096] [2024-09-11 20:11:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:24,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:24,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:24,140 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:24,142 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 20:11:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:24,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-11 20:11:24,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-09-11 20:11:24,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-09-11 20:11:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454389096] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:26,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 14] total 30 [2024-09-11 20:11:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163296407] [2024-09-11 20:11:26,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:26,057 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 20:11:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 20:11:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:11:26,058 INFO L87 Difference]: Start difference. First operand 163 states and 214 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2024-09-11 20:11:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:27,646 INFO L93 Difference]: Finished difference Result 242 states and 331 transitions. [2024-09-11 20:11:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-11 20:11:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) Word has length 101 [2024-09-11 20:11:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:27,649 INFO L225 Difference]: With dead ends: 242 [2024-09-11 20:11:27,649 INFO L226 Difference]: Without dead ends: 226 [2024-09-11 20:11:27,650 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=414, Invalid=1748, Unknown=0, NotChecked=0, Total=2162 [2024-09-11 20:11:27,651 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:27,651 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 369 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-11 20:11:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-09-11 20:11:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2024-09-11 20:11:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 125 states have (on average 1.176) internal successors, (147), 134 states have internal predecessors, (147), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2024-09-11 20:11:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 279 transitions. [2024-09-11 20:11:27,806 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 279 transitions. Word has length 101 [2024-09-11 20:11:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:27,806 INFO L474 AbstractCegarLoop]: Abstraction has 211 states and 279 transitions. [2024-09-11 20:11:27,806 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2024-09-11 20:11:27,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 279 transitions. [2024-09-11 20:11:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-11 20:11:27,808 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:27,808 INFO L216 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:27,821 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-11 20:11:28,011 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-11 20:11:28,012 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:28,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2059350908, now seen corresponding path program 2 times [2024-09-11 20:11:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084239379] [2024-09-11 20:11:28,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:11:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:11:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:11:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:11:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 20:11:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-11 20:11:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,263 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-11 20:11:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-11 20:11:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-09-11 20:11:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-09-11 20:11:28,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:28,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084239379] [2024-09-11 20:11:28,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084239379] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:28,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038796669] [2024-09-11 20:11:28,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:11:28,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:28,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:28,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:28,280 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 20:11:28,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:11:28,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:11:28,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:11:28,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 82 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-09-11 20:11:28,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 82 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-09-11 20:11:29,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038796669] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:29,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:29,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 14] total 28 [2024-09-11 20:11:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265054775] [2024-09-11 20:11:29,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:29,358 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-11 20:11:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-11 20:11:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:11:29,359 INFO L87 Difference]: Start difference. First operand 211 states and 279 transitions. Second operand has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 26 states have internal predecessors, (67), 18 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (51), 20 states have call predecessors, (51), 18 states have call successors, (51) [2024-09-11 20:11:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:30,015 INFO L93 Difference]: Finished difference Result 235 states and 305 transitions. [2024-09-11 20:11:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 20:11:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 26 states have internal predecessors, (67), 18 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (51), 20 states have call predecessors, (51), 18 states have call successors, (51) Word has length 109 [2024-09-11 20:11:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:30,017 INFO L225 Difference]: With dead ends: 235 [2024-09-11 20:11:30,017 INFO L226 Difference]: Without dead ends: 153 [2024-09-11 20:11:30,018 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2024-09-11 20:11:30,018 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:30,019 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 498 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:11:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-09-11 20:11:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2024-09-11 20:11:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 91 states have internal predecessors, (97), 41 states have call successors, (41), 16 states have call predecessors, (41), 16 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-11 20:11:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 178 transitions. [2024-09-11 20:11:30,113 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 178 transitions. Word has length 109 [2024-09-11 20:11:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:30,113 INFO L474 AbstractCegarLoop]: Abstraction has 145 states and 178 transitions. [2024-09-11 20:11:30,114 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 26 states have internal predecessors, (67), 18 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (51), 20 states have call predecessors, (51), 18 states have call successors, (51) [2024-09-11 20:11:30,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 178 transitions. [2024-09-11 20:11:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-09-11 20:11:30,115 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:30,115 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:30,131 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-11 20:11:30,319 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-11 20:11:30,320 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:30,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash -628810621, now seen corresponding path program 3 times [2024-09-11 20:11:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46808388] [2024-09-11 20:11:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,507 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:11:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:11:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:11:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-09-11 20:11:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-11 20:11:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-11 20:11:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-11 20:11:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-11 20:11:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-11 20:11:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-11 20:11:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 51 proven. 28 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-11 20:11:30,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46808388] [2024-09-11 20:11:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46808388] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504178924] [2024-09-11 20:11:30,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:11:30,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:30,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:30,546 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:30,548 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-11 20:11:30,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 20:11:30,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:11:30,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:11:30,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 146 proven. 46 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2024-09-11 20:11:30,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 134 proven. 2 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-09-11 20:11:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504178924] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:30,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:30,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 20 [2024-09-11 20:11:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555392967] [2024-09-11 20:11:30,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:30,968 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:11:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:30,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:11:30,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:11:30,969 INFO L87 Difference]: Start difference. First operand 145 states and 178 transitions. Second operand has 20 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 12 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (36), 11 states have call predecessors, (36), 9 states have call successors, (36) [2024-09-11 20:11:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:31,476 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2024-09-11 20:11:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:11:31,477 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 12 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (36), 11 states have call predecessors, (36), 9 states have call successors, (36) Word has length 113 [2024-09-11 20:11:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:31,478 INFO L225 Difference]: With dead ends: 152 [2024-09-11 20:11:31,478 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:11:31,479 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:11:31,479 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 60 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:31,479 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 200 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:11:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:11:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:11:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:11:31,481 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2024-09-11 20:11:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:31,481 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:11:31,481 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 12 states have call successors, (36), 4 states have call predecessors, (36), 2 states have return successors, (36), 11 states have call predecessors, (36), 9 states have call successors, (36) [2024-09-11 20:11:31,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:11:31,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:11:31,484 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:11:31,501 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-11 20:11:31,688 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-11 20:11:31,691 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:31,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:11:35,515 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:11:35,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:11:35 BoogieIcfgContainer [2024-09-11 20:11:35,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:11:35,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:11:35,531 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:11:35,531 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:11:35,531 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:10:19" (3/4) ... [2024-09-11 20:11:35,533 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:11:35,536 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 20:11:35,539 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-09-11 20:11:35,539 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-11 20:11:35,540 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 20:11:35,540 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:11:35,540 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:11:35,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:11:35,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:11:35,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:11:35,633 INFO L158 Benchmark]: Toolchain (without parser) took 76487.33ms. Allocated memory was 151.0MB in the beginning and 343.9MB in the end (delta: 192.9MB). Free memory was 96.6MB in the beginning and 109.8MB in the end (delta: -13.2MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. [2024-09-11 20:11:35,633 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 114.7MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:11:35,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.85ms. Allocated memory is still 151.0MB. Free memory was 96.6MB in the beginning and 84.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:11:35,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.05ms. Allocated memory is still 151.0MB. Free memory was 84.9MB in the beginning and 83.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:11:35,635 INFO L158 Benchmark]: Boogie Preprocessor took 40.71ms. Allocated memory is still 151.0MB. Free memory was 83.4MB in the beginning and 81.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:11:35,635 INFO L158 Benchmark]: RCFGBuilder took 294.40ms. Allocated memory is still 151.0MB. Free memory was 81.4MB in the beginning and 68.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:11:35,636 INFO L158 Benchmark]: TraceAbstraction took 75784.37ms. Allocated memory was 151.0MB in the beginning and 343.9MB in the end (delta: 192.9MB). Free memory was 68.2MB in the beginning and 115.0MB in the end (delta: -46.7MB). Peak memory consumption was 157.2MB. Max. memory is 16.1GB. [2024-09-11 20:11:35,636 INFO L158 Benchmark]: Witness Printer took 101.78ms. Allocated memory is still 343.9MB. Free memory was 115.0MB in the beginning and 109.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:11:35,640 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.26ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 114.7MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.85ms. Allocated memory is still 151.0MB. Free memory was 96.6MB in the beginning and 84.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.05ms. Allocated memory is still 151.0MB. Free memory was 84.9MB in the beginning and 83.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.71ms. Allocated memory is still 151.0MB. Free memory was 83.4MB in the beginning and 81.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.40ms. Allocated memory is still 151.0MB. Free memory was 81.4MB in the beginning and 68.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 75784.37ms. Allocated memory was 151.0MB in the beginning and 343.9MB in the end (delta: 192.9MB). Free memory was 68.2MB in the beginning and 115.0MB in the end (delta: -46.7MB). Peak memory consumption was 157.2MB. Max. memory is 16.1GB. * Witness Printer took 101.78ms. Allocated memory is still 343.9MB. Free memory was 115.0MB in the beginning and 109.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.9s, OverallIterations: 16, TraceHistogramMax: 19, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 38.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 2832 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2405 mSDsCounter, 575 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3252 IncrementalHoareTripleChecker+Invalid, 3827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 575 mSolverCounterUnsat, 427 mSDtfsCounter, 3252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1880 GetRequests, 1621 SyntacticMatches, 6 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 31.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=14, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 97 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 1788 NumberOfCodeBlocks, 1731 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2133 ConstructedInterpolants, 0 QuantifiedInterpolants, 22802 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2112 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 8881/9624 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: 44]: Loop Invariant Derived loop invariant: (((A == (q + r)) && (d == p)) && (B == 1)) - InvariantResult [Line: 59]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((d == 1) && (p == 1)) && (q == 0)) && (A == r)) && (B == 1)) || (((((((8 <= p) && (q == 0)) && (d == p)) && (((d / 2) + A) == (r + (p / 2)))) && (B == 1)) && ((d % 2) == 0)) && ((d / 2) <= r))) || ((((((2 == p) && (q == 0)) && (A == r)) && (1 <= r)) && (B == 1)) && (2 == d))) || ((((((p == 4) && (2 <= r)) && (q == 0)) && (A == r)) && (d == 4)) && (B == 1))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:11:35,720 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