./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.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 1619c1c02ba7c9b660af32e6427e3b3d5cd6ca3ff286b9db386918ae0c8b508c --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:57:12,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:57:12,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:57:12,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:57:12,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:57:12,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:57:12,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:57:12,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:57:12,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:57:12,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:57:12,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:57:12,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:57:12,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:57:12,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:57:12,732 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:57:12,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:57:12,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:57:12,733 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:57:12,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:57:12,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:57:12,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:57:12,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:57:12,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:57:12,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:57:12,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:57:12,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:57:12,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:57:12,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:57:12,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:57:12,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:57:12,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:57:12,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:57:12,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:57:12,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:57:12,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:57:12,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:57:12,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:57:12,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:57:12,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:57:12,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:57:12,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:57:12,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:57:12,745 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 -> 1619c1c02ba7c9b660af32e6427e3b3d5cd6ca3ff286b9db386918ae0c8b508c Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:57:12,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:57:13,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:57:13,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:57:13,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:57:13,011 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:57:13,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c [2024-10-15 14:57:14,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:57:14,624 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:57:14,624 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c [2024-10-15 14:57:14,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/835fb4bf7/09604bb9d63b4767a84891471a12ed2e/FLAGbbe92206e [2024-10-15 14:57:14,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/835fb4bf7/09604bb9d63b4767a84891471a12ed2e [2024-10-15 14:57:14,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:57:14,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:57:14,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:57:14,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:57:14,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:57:14,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:14,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf41e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14, skipping insertion in model container [2024-10-15 14:57:14,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:14,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:57:14,860 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c[526,539] [2024-10-15 14:57:14,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:57:14,897 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:57:14,910 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c[526,539] [2024-10-15 14:57:14,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:57:14,941 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:57:14,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14 WrapperNode [2024-10-15 14:57:14,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:57:14,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:57:14,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:57:14,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:57:14,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:14,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:14,962 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:57:14,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:57:14,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:57:14,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:57:14,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:57:14,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:14,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:14,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:15,001 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-10-15 14:57:15,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:15,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:15,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:15,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:15,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:15,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:15,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:57:15,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:57:15,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:57:15,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:57:15,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (1/1) ... [2024-10-15 14:57:15,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:57:15,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:15,050 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-10-15 14:57:15,053 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-10-15 14:57:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:57:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:57:15,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:57:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:57:15,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:57:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:57:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 14:57:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:57:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:57:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:57:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:57:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:57:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:57:15,173 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:57:15,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:57:15,370 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:57:15,372 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:57:15,401 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:57:15,401 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:57:15,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:15 BoogieIcfgContainer [2024-10-15 14:57:15,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:57:15,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:57:15,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:57:15,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:57:15,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:57:14" (1/3) ... [2024-10-15 14:57:15,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bd12fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:15, skipping insertion in model container [2024-10-15 14:57:15,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:14" (2/3) ... [2024-10-15 14:57:15,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bd12fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:15, skipping insertion in model container [2024-10-15 14:57:15,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:15" (3/3) ... [2024-10-15 14:57:15,413 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound20.c [2024-10-15 14:57:15,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:57:15,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:57:15,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:57:15,534 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@28edf006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:57:15,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:57:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:57:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:57:15,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:15,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:15,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:15,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash -909137831, now seen corresponding path program 1 times [2024-10-15 14:57:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340189527] [2024-10-15 14:57:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:57:15,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:15,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340189527] [2024-10-15 14:57:15,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340189527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:57:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008013778] [2024-10-15 14:57:15,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:15,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:57:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:15,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:57:15,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:57:15,745 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:57:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:15,778 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2024-10-15 14:57:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:57:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-15 14:57:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:15,786 INFO L225 Difference]: With dead ends: 58 [2024-10-15 14:57:15,786 INFO L226 Difference]: Without dead ends: 29 [2024-10-15 14:57:15,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-10-15 14:57:15,792 INFO L432 NwaCegarLoop]: 39 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, 39 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-10-15 14:57:15,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-15 14:57:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-15 14:57:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 14:57:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-15 14:57:15,824 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-10-15 14:57:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:15,824 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-15 14:57:15,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:57:15,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-10-15 14:57:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:57:15,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:15,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:15,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:57:15,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:15,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash -229079461, now seen corresponding path program 1 times [2024-10-15 14:57:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:15,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881665428] [2024-10-15 14:57:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:15,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:57:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881665428] [2024-10-15 14:57:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881665428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:16,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:16,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64905893] [2024-10-15 14:57:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:16,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:16,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:16,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:16,028 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:57:16,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:16,093 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-15 14:57:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:16,093 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-15 14:57:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:16,095 INFO L225 Difference]: With dead ends: 42 [2024-10-15 14:57:16,095 INFO L226 Difference]: Without dead ends: 40 [2024-10-15 14:57:16,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-10-15 14:57:16,097 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:16,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-15 14:57:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-10-15 14:57:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 14:57:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-15 14:57:16,111 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2024-10-15 14:57:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:16,113 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-15 14:57:16,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-15 14:57:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-15 14:57:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:57:16,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:16,116 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:16,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:57:16,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:16,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 520476838, now seen corresponding path program 1 times [2024-10-15 14:57:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:16,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584969327] [2024-10-15 14:57:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:57:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:16,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584969327] [2024-10-15 14:57:16,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584969327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:16,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:16,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:16,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844391941] [2024-10-15 14:57:16,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:16,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:16,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:16,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:16,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:16,277 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:57:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:16,352 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-10-15 14:57:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:16,353 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-15 14:57:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:16,354 INFO L225 Difference]: With dead ends: 46 [2024-10-15 14:57:16,355 INFO L226 Difference]: Without dead ends: 44 [2024-10-15 14:57:16,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-10-15 14:57:16,356 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:16,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-15 14:57:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-10-15 14:57:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 14:57:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-15 14:57:16,365 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2024-10-15 14:57:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:16,366 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-15 14:57:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:57:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-15 14:57:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-15 14:57:16,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:16,368 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:16,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:57:16,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:16,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1140086011, now seen corresponding path program 1 times [2024-10-15 14:57:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:16,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95590753] [2024-10-15 14:57:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140540532] [2024-10-15 14:57:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:16,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:16,414 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-10-15 14:57:16,418 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:57:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 14:57:16,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:57:16,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:57:16,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95590753] [2024-10-15 14:57:16,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140540532] [2024-10-15 14:57:16,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140540532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:16,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:16,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:16,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405385393] [2024-10-15 14:57:16,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:16,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:16,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:16,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:16,611 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:57:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:16,679 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-10-15 14:57:16,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:16,680 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-10-15 14:57:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:16,681 INFO L225 Difference]: With dead ends: 63 [2024-10-15 14:57:16,681 INFO L226 Difference]: Without dead ends: 50 [2024-10-15 14:57:16,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:57:16,683 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:16,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-15 14:57:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-15 14:57:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-15 14:57:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-10-15 14:57:16,700 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 26 [2024-10-15 14:57:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:16,700 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-10-15 14:57:16,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:57:16,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-10-15 14:57:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-15 14:57:16,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:16,702 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:16,720 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:57:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:16,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash -975701997, now seen corresponding path program 1 times [2024-10-15 14:57:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531576146] [2024-10-15 14:57:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461908071] [2024-10-15 14:57:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:16,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:16,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:16,923 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-10-15 14:57:16,924 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:57:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:57:16,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:57:17,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:57:17,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:17,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531576146] [2024-10-15 14:57:17,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:17,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461908071] [2024-10-15 14:57:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461908071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:17,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:17,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:17,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427223070] [2024-10-15 14:57:17,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:17,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:17,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:17,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:17,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:17,070 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:57:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:17,150 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-10-15 14:57:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:17,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-15 14:57:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:17,155 INFO L225 Difference]: With dead ends: 63 [2024-10-15 14:57:17,155 INFO L226 Difference]: Without dead ends: 61 [2024-10-15 14:57:17,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-10-15 14:57:17,156 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:17,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:57:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-15 14:57:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-10-15 14:57:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-15 14:57:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-10-15 14:57:17,176 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 33 [2024-10-15 14:57:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:17,179 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-10-15 14:57:17,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:57:17,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-10-15 14:57:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-15 14:57:17,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:17,180 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:17,197 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:17,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:17,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:17,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash -928833564, now seen corresponding path program 1 times [2024-10-15 14:57:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:17,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424619825] [2024-10-15 14:57:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:17,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1523541528] [2024-10-15 14:57:17,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:17,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:17,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:17,404 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-10-15 14:57:17,405 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:57:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 14:57:17,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-15 14:57:17,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-15 14:57:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424619825] [2024-10-15 14:57:17,703 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523541528] [2024-10-15 14:57:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523541528] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:17,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:57:17,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-15 14:57:17,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491394185] [2024-10-15 14:57:17,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:17,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:17,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:57:17,706 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:57:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:17,783 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-10-15 14:57:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:17,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-10-15 14:57:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:17,786 INFO L225 Difference]: With dead ends: 70 [2024-10-15 14:57:17,786 INFO L226 Difference]: Without dead ends: 68 [2024-10-15 14:57:17,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:57:17,789 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:17,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:57:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-15 14:57:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-10-15 14:57:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-15 14:57:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-10-15 14:57:17,817 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 43 [2024-10-15 14:57:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:17,819 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-10-15 14:57:17,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:57:17,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-10-15 14:57:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-15 14:57:17,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:17,821 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:17,840 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:18,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 14:57:18,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash -238148106, now seen corresponding path program 1 times [2024-10-15 14:57:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:18,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784462114] [2024-10-15 14:57:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:57:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-15 14:57:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784462114] [2024-10-15 14:57:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784462114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:18,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371917296] [2024-10-15 14:57:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:18,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:18,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:18,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:18,204 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-15 14:57:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:18,265 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-10-15 14:57:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:18,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2024-10-15 14:57:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:18,267 INFO L225 Difference]: With dead ends: 75 [2024-10-15 14:57:18,268 INFO L226 Difference]: Without dead ends: 63 [2024-10-15 14:57:18,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10-15 14:57:18,270 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:18,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:57:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-15 14:57:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-15 14:57:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-15 14:57:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2024-10-15 14:57:18,292 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 49 [2024-10-15 14:57:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:18,292 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2024-10-15 14:57:18,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-15 14:57:18,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2024-10-15 14:57:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-15 14:57:18,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:18,294 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:18,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:57:18,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:18,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1374799408, now seen corresponding path program 1 times [2024-10-15 14:57:18,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:18,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14365315] [2024-10-15 14:57:18,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:18,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228309767] [2024-10-15 14:57:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:18,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:18,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:18,339 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-10-15 14:57:18,340 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:57:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:18,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-15 14:57:18,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-15 14:57:18,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-15 14:57:20,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14365315] [2024-10-15 14:57:20,246 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228309767] [2024-10-15 14:57:20,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228309767] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:20,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:20,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-15 14:57:20,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207664100] [2024-10-15 14:57:20,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:20,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:57:20,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:57:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:57:20,248 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-15 14:57:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:20,891 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2024-10-15 14:57:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:57:20,892 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 63 [2024-10-15 14:57:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:20,893 INFO L225 Difference]: With dead ends: 138 [2024-10-15 14:57:20,893 INFO L226 Difference]: Without dead ends: 115 [2024-10-15 14:57:20,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 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-10-15 14:57:20,894 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:20,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 225 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:57:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-15 14:57:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-10-15 14:57:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 71 states have internal predecessors, (80), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-15 14:57:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-10-15 14:57:20,941 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 63 [2024-10-15 14:57:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:20,942 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-10-15 14:57:20,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-15 14:57:20,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-10-15 14:57:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-15 14:57:20,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:20,944 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:20,963 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 14:57:21,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:21,145 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:21,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2048390162, now seen corresponding path program 1 times [2024-10-15 14:57:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446341005] [2024-10-15 14:57:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450302166] [2024-10-15 14:57:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:21,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:21,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:21,178 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-10-15 14:57:21,180 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:57:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:21,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-15 14:57:21,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 14:57:21,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-15 14:57:22,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:22,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446341005] [2024-10-15 14:57:22,020 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:22,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450302166] [2024-10-15 14:57:22,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450302166] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:22,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:22,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-10-15 14:57:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489829931] [2024-10-15 14:57:22,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:22,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 14:57:22,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:22,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 14:57:22,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-15 14:57:22,023 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-15 14:57:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:22,747 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2024-10-15 14:57:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 14:57:22,748 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 74 [2024-10-15 14:57:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:22,751 INFO L225 Difference]: With dead ends: 168 [2024-10-15 14:57:22,751 INFO L226 Difference]: Without dead ends: 136 [2024-10-15 14:57:22,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:57:22,752 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:22,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 195 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:57:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-15 14:57:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-10-15 14:57:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 70 states have internal predecessors, (76), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-15 14:57:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-10-15 14:57:22,793 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 74 [2024-10-15 14:57:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:22,794 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-10-15 14:57:22,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-15 14:57:22,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-10-15 14:57:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-15 14:57:22,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:22,796 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:22,813 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:22,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:22,997 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:22,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1556827571, now seen corresponding path program 1 times [2024-10-15 14:57:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895074657] [2024-10-15 14:57:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:57:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:57:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:57:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:57:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:57:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:57:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-15 14:57:23,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895074657] [2024-10-15 14:57:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895074657] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015775968] [2024-10-15 14:57:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:23,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:23,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:23,363 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-10-15 14:57:23,365 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:57:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:23,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-15 14:57:23,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-15 14:57:23,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-15 14:57:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015775968] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:23,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:57:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-15 14:57:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046260489] [2024-10-15 14:57:23,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:23,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 14:57:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 14:57:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:57:23,964 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-15 14:57:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:24,173 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2024-10-15 14:57:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 14:57:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 79 [2024-10-15 14:57:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:24,176 INFO L225 Difference]: With dead ends: 129 [2024-10-15 14:57:24,176 INFO L226 Difference]: Without dead ends: 100 [2024-10-15 14:57:24,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:57:24,180 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:24,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 225 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:57:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-15 14:57:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-15 14:57:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-15 14:57:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2024-10-15 14:57:24,207 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 79 [2024-10-15 14:57:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:24,207 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2024-10-15 14:57:24,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-15 14:57:24,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2024-10-15 14:57:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-15 14:57:24,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:24,209 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:24,226 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-15 14:57:24,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-15 14:57:24,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash -802122381, now seen corresponding path program 2 times [2024-10-15 14:57:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277431786] [2024-10-15 14:57:24,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394919891] [2024-10-15 14:57:24,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:57:24,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:24,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:24,442 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-10-15 14:57:24,444 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 14:57:24,505 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:57:24,505 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:57:24,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-15 14:57:24,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:57:24,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:57:41,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277431786] [2024-10-15 14:57:41,202 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394919891] [2024-10-15 14:57:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394919891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:41,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:41,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-10-15 14:57:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504456316] [2024-10-15 14:57:41,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:41,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-15 14:57:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:41,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-15 14:57:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-15 14:57:41,205 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-15 14:57:53,868 WARN L286 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 171 DAG size of output: 83 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:57:55,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:57:56,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:58:14,017 WARN L286 SmtUtils]: Spent 11.17s on a formula simplification. DAG size of input: 156 DAG size of output: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:58:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:15,085 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2024-10-15 14:58:15,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 14:58:15,086 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 93 [2024-10-15 14:58:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:15,088 INFO L225 Difference]: With dead ends: 203 [2024-10-15 14:58:15,088 INFO L226 Difference]: Without dead ends: 170 [2024-10-15 14:58:15,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:58:15,089 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 66 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:15,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 513 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-10-15 14:58:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-15 14:58:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-10-15 14:58:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 98 states have (on average 1.183673469387755) internal successors, (116), 105 states have internal predecessors, (116), 51 states have call successors, (51), 17 states have call predecessors, (51), 16 states have return successors, (49), 43 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-15 14:58:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2024-10-15 14:58:15,147 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 93 [2024-10-15 14:58:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:15,148 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2024-10-15 14:58:15,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-15 14:58:15,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2024-10-15 14:58:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-15 14:58:15,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:15,150 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:15,167 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-15 14:58:15,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:15,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:15,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash 644553835, now seen corresponding path program 2 times [2024-10-15 14:58:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427360286] [2024-10-15 14:58:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:15,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:58:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459627376] [2024-10-15 14:58:15,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:58:15,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:15,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:15,402 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-10-15 14:58:15,403 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 14:58:15,469 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:58:15,469 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:58:15,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-15 14:58:15,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:58:15,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:58:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:58:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:18,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427360286] [2024-10-15 14:58:18,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:58:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459627376] [2024-10-15 14:58:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459627376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:58:18,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:58:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-10-15 14:58:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240785866] [2024-10-15 14:58:18,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:58:18,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-15 14:58:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:18,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-15 14:58:18,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2024-10-15 14:58:18,988 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2024-10-15 14:58:23,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:58:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:23,631 INFO L93 Difference]: Finished difference Result 246 states and 327 transitions. [2024-10-15 14:58:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-15 14:58:23,632 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) Word has length 104 [2024-10-15 14:58:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:23,634 INFO L225 Difference]: With dead ends: 246 [2024-10-15 14:58:23,634 INFO L226 Difference]: Without dead ends: 185 [2024-10-15 14:58:23,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2024-10-15 14:58:23,635 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:23,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 422 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-15 14:58:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-15 14:58:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 161. [2024-10-15 14:58:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 103 states have internal predecessors, (112), 47 states have call successors, (47), 18 states have call predecessors, (47), 17 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-15 14:58:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 204 transitions. [2024-10-15 14:58:23,712 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 204 transitions. Word has length 104 [2024-10-15 14:58:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:23,713 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 204 transitions. [2024-10-15 14:58:23,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2024-10-15 14:58:23,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2024-10-15 14:58:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-15 14:58:23,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:23,715 INFO L215 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:23,732 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-15 14:58:23,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:23,916 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1191181482, now seen corresponding path program 2 times [2024-10-15 14:58:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239262266] [2024-10-15 14:58:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:58:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:58:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:58:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:58:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:58:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:58:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:58:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:58:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:58:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:58:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:58:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:58:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:58:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:58:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:58:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-15 14:58:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-15 14:58:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-15 14:58:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-15 14:58:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239262266] [2024-10-15 14:58:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239262266] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:58:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941815293] [2024-10-15 14:58:24,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:58:24,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:24,327 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-10-15 14:58:24,329 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-15 14:58:24,392 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:58:24,392 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:58:24,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-15 14:58:24,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-15 14:58:24,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:58:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-15 14:58:25,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941815293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:58:25,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:58:25,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 25 [2024-10-15 14:58:25,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213851464] [2024-10-15 14:58:25,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:58:25,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-15 14:58:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:25,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 14:58:25,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-10-15 14:58:25,723 INFO L87 Difference]: Start difference. First operand 161 states and 204 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) [2024-10-15 14:58:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:26,124 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2024-10-15 14:58:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:58:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) Word has length 109 [2024-10-15 14:58:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:26,125 INFO L225 Difference]: With dead ends: 187 [2024-10-15 14:58:26,125 INFO L226 Difference]: Without dead ends: 145 [2024-10-15 14:58:26,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:58:26,126 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:26,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 334 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:58:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-15 14:58:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-10-15 14:58:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 89 states have internal predecessors, (96), 38 states have call successors, (38), 17 states have call predecessors, (38), 16 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-15 14:58:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2024-10-15 14:58:26,192 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 109 [2024-10-15 14:58:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:26,192 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2024-10-15 14:58:26,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) [2024-10-15 14:58:26,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2024-10-15 14:58:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-15 14:58:26,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:26,194 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:26,207 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-15 14:58:26,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-15 14:58:26,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:26,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -626389098, now seen corresponding path program 1 times [2024-10-15 14:58:26,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:26,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059985371] [2024-10-15 14:58:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:58:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:58:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:58:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:58:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:58:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:58:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:58:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:58:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:58:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:58:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:58:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:58:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:58:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-15 14:58:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-15 14:58:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-15 14:58:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-15 14:58:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-15 14:58:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-15 14:58:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:58:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 51 proven. 28 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-15 14:58:26,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059985371] [2024-10-15 14:58:26,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059985371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:58:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860307282] [2024-10-15 14:58:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:26,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:26,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:26,648 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-10-15 14:58:26,649 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-15 14:58:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:26,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:58:26,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-15 14:58:26,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:58:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-15 14:58:26,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860307282] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:58:26,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:58:26,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 9 [2024-10-15 14:58:26,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096113845] [2024-10-15 14:58:26,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:58:26,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:58:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:26,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:58:26,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:58:26,923 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2024-10-15 14:58:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:27,106 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2024-10-15 14:58:27,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:58:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) Word has length 121 [2024-10-15 14:58:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:27,109 INFO L225 Difference]: With dead ends: 155 [2024-10-15 14:58:27,109 INFO L226 Difference]: Without dead ends: 148 [2024-10-15 14:58:27,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 276 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:58:27,110 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:27,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 185 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:58:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-15 14:58:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-10-15 14:58:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 93 states have internal predecessors, (100), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-15 14:58:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 182 transitions. [2024-10-15 14:58:27,199 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 182 transitions. Word has length 121 [2024-10-15 14:58:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:27,200 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 182 transitions. [2024-10-15 14:58:27,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2024-10-15 14:58:27,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 182 transitions. [2024-10-15 14:58:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-15 14:58:27,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:27,202 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:27,220 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-15 14:58:27,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-15 14:58:27,403 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:27,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1967500462, now seen corresponding path program 1 times [2024-10-15 14:58:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:27,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232071917] [2024-10-15 14:58:27,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:27,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:58:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:58:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:58:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:58:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:58:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:58:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:58:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:58:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:58:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:58:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:58:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:58:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:58:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-15 14:58:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-15 14:58:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-15 14:58:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-15 14:58:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-15 14:58:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-15 14:58:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:58:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-10-15 14:58:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232071917] [2024-10-15 14:58:27,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232071917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:58:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324493142] [2024-10-15 14:58:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:27,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:27,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:27,657 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-10-15 14:58:27,659 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-15 14:58:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:58:27,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 14:58:27,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-10-15 14:58:27,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:58:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324493142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:58:27,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:58:27,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-10-15 14:58:27,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459274639] [2024-10-15 14:58:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:58:27,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:58:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:27,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:58:27,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:58:27,847 INFO L87 Difference]: Start difference. First operand 147 states and 182 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-15 14:58:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:28,044 INFO L93 Difference]: Finished difference Result 190 states and 238 transitions. [2024-10-15 14:58:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:58:28,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 123 [2024-10-15 14:58:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:28,046 INFO L225 Difference]: With dead ends: 190 [2024-10-15 14:58:28,047 INFO L226 Difference]: Without dead ends: 147 [2024-10-15 14:58:28,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:58:28,049 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:28,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 125 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:58:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-15 14:58:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2024-10-15 14:58:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 83 states have internal predecessors, (88), 34 states have call successors, (34), 17 states have call predecessors, (34), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-15 14:58:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2024-10-15 14:58:28,123 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 123 [2024-10-15 14:58:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:28,126 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2024-10-15 14:58:28,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-15 14:58:28,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2024-10-15 14:58:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-15 14:58:28,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:58:28,127 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:28,145 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-15 14:58:28,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-15 14:58:28,332 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:58:28,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -478157618, now seen corresponding path program 3 times [2024-10-15 14:58:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:58:28,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172171754] [2024-10-15 14:58:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:58:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:58:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:58:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373421309] [2024-10-15 14:58:28,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:58:28,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:58:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:58:28,372 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-10-15 14:58:28,376 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-15 14:58:28,437 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-15 14:58:28,437 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:58:28,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-15 14:58:28,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:58:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 163 proven. 53 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2024-10-15 14:58:28,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:58:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-15 14:58:28,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:58:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172171754] [2024-10-15 14:58:28,718 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:58:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373421309] [2024-10-15 14:58:28,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373421309] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:58:28,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:58:28,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-10-15 14:58:28,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765314284] [2024-10-15 14:58:28,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:58:28,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 14:58:28,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:58:28,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 14:58:28,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-15 14:58:28,719 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 16 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-15 14:58:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:58:28,956 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2024-10-15 14:58:28,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:58:28,957 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) Word has length 134 [2024-10-15 14:58:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:58:28,958 INFO L225 Difference]: With dead ends: 130 [2024-10-15 14:58:28,958 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:58:28,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:58:28,959 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:58:28,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:58:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:58:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:58:28,959 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-10-15 14:58:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:58:28,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2024-10-15 14:58:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:58:28,960 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:58:28,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2024-10-15 14:58:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:58:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:58:28,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:58:28,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:58:28,980 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-15 14:58:29,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-15 14:58:29,167 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:58:29,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:58:31,679 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:58:31,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:58:31 BoogieIcfgContainer [2024-10-15 14:58:31,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:58:31,700 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:58:31,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:58:31,700 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:58:31,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:15" (3/4) ... [2024-10-15 14:58:31,702 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:58:31,750 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:58:31,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:58:31,751 INFO L158 Benchmark]: Toolchain (without parser) took 77103.45ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 101.3MB in the beginning and 121.7MB in the end (delta: -20.4MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2024-10-15 14:58:31,751 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 79.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:58:31,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.86ms. Allocated memory is still 169.9MB. Free memory was 101.1MB in the beginning and 88.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:58:31,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.36ms. Allocated memory is still 169.9MB. Free memory was 88.7MB in the beginning and 87.7MB in the end (delta: 991.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:58:31,752 INFO L158 Benchmark]: Boogie Preprocessor took 48.07ms. Allocated memory is still 169.9MB. Free memory was 87.4MB in the beginning and 85.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:58:31,753 INFO L158 Benchmark]: RCFGBuilder took 390.20ms. Allocated memory is still 169.9MB. Free memory was 85.6MB in the beginning and 72.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:58:31,753 INFO L158 Benchmark]: TraceAbstraction took 76294.24ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 71.4MB in the beginning and 123.8MB in the end (delta: -52.3MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2024-10-15 14:58:31,753 INFO L158 Benchmark]: Witness Printer took 51.04ms. Allocated memory is still 251.7MB. Free memory was 123.8MB in the beginning and 121.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:58:31,755 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.19ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 79.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.86ms. Allocated memory is still 169.9MB. Free memory was 101.1MB in the beginning and 88.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.36ms. Allocated memory is still 169.9MB. Free memory was 88.7MB in the beginning and 87.7MB in the end (delta: 991.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.07ms. Allocated memory is still 169.9MB. Free memory was 87.4MB in the beginning and 85.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.20ms. Allocated memory is still 169.9MB. Free memory was 85.6MB in the beginning and 72.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 76294.24ms. Allocated memory was 169.9MB in the beginning and 251.7MB in the end (delta: 81.8MB). Free memory was 71.4MB in the beginning and 123.8MB in the end (delta: -52.3MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. * Witness Printer took 51.04ms. Allocated memory is still 251.7MB. Free memory was 123.8MB in the beginning and 121.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.7s, OverallIterations: 16, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 41.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 3086 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2515 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2567 IncrementalHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 571 mSDtfsCounter, 2567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2069 GetRequests, 1867 SyntacticMatches, 10 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 34.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=11, InterpolantAutomatonStates: 150, 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, 96 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 2106 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2327 ConstructedInterpolants, 0 QuantifiedInterpolants, 21218 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2338 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 9533/10134 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: ((((d == p) && (1 <= p)) && (((long long) A + d) == (((long long) q + p) + r))) && (B == 1)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((A == r) && (p == 2)) && (d == 2)) && (q == 0)) && (B == 1)) || (((((((A == r) && (((long long) A + d) == ((long long) p + r))) && (((d >= 0) ? (d / 2) : ((d / 2) - 1)) <= r)) && (((d >= 0) ? (d % 2) : ((d % 2) + 2)) == 0)) && (q == 0)) && (B == 1)) && (4 <= ((d >= 0) ? (d / 2) : ((d / 2) - 1))))) || ((((((A == r) && (d == 4)) && (2 <= r)) && (q == 0)) && (B == 1)) && (p == 4))) || (((((A == r) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:58:31,834 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