./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.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_valuebound2.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 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 --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:05,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:57:05,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:57:05,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:57:05,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:57:05,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:57:05,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:57:05,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:57:05,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:57:05,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:57:05,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:57:05,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:57:05,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:57:05,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:57:05,341 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:57:05,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:57:05,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:57:05,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:57:05,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:57:05,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:57:05,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:57:05,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:57:05,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:57:05,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:57:05,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:57:05,347 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:57:05,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:57:05,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:57:05,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:57:05,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:57:05,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:57:05,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:57:05,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:57:05,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:57:05,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:57:05,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:57:05,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:57:05,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:57:05,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:57:05,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:57:05,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:57:05,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:57:05,354 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 -> 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 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:05,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:57:05,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:57:05,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:57:05,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:57:05,637 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:57:05,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2024-10-15 14:57:07,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:57:07,281 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:57:07,282 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2024-10-15 14:57:07,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6f244613d/69bd7661d73f4a16a83a2b0bca100479/FLAG3dcba948c [2024-10-15 14:57:07,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6f244613d/69bd7661d73f4a16a83a2b0bca100479 [2024-10-15 14:57:07,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:57:07,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:57:07,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:57:07,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:57:07,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:57:07,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:57:07" (1/1) ... [2024-10-15 14:57:07,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2533c2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:07, skipping insertion in model container [2024-10-15 14:57:07,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:57:07" (1/1) ... [2024-10-15 14:57:07,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:57:07,903 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_valuebound2.c[526,539] [2024-10-15 14:57:07,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:57:07,940 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:57:07,952 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_valuebound2.c[526,539] [2024-10-15 14:57:07,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:57:07,982 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:57:07,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:07 WrapperNode [2024-10-15 14:57:07,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:57:07,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:57:07,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:57:07,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:57:07,990 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:07" (1/1) ... [2024-10-15 14:57:07,996 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:07" (1/1) ... [2024-10-15 14:57:08,003 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:57:08,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:57:08,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:57:08,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:57:08,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:57:08,014 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:07" (1/1) ... [2024-10-15 14:57:08,014 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:07" (1/1) ... [2024-10-15 14:57:08,016 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:07" (1/1) ... [2024-10-15 14:57:08,039 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:08,039 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:07" (1/1) ... [2024-10-15 14:57:08,040 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:07" (1/1) ... [2024-10-15 14:57:08,043 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:07" (1/1) ... [2024-10-15 14:57:08,050 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:07" (1/1) ... [2024-10-15 14:57:08,051 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:07" (1/1) ... [2024-10-15 14:57:08,052 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:07" (1/1) ... [2024-10-15 14:57:08,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:57:08,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:57:08,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:57:08,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:57:08,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:07" (1/1) ... [2024-10-15 14:57:08,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:57:08,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:08,090 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:08,092 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:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:57:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:57:08,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:57:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:57:08,136 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:57:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:57:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 14:57:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:57:08,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:57:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:57:08,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:57:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:57:08,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:57:08,189 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:57:08,191 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:57:08,339 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:57:08,339 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:57:08,361 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:57:08,362 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:57:08,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:08 BoogieIcfgContainer [2024-10-15 14:57:08,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:57:08,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:57:08,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:57:08,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:57:08,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:57:07" (1/3) ... [2024-10-15 14:57:08,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c226521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:08, skipping insertion in model container [2024-10-15 14:57:08,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:57:07" (2/3) ... [2024-10-15 14:57:08,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c226521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:08, skipping insertion in model container [2024-10-15 14:57:08,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:08" (3/3) ... [2024-10-15 14:57:08,370 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound2.c [2024-10-15 14:57:08,387 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:57:08,387 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:57:08,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:57:08,435 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;@709b2a83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:57:08,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:57:08,439 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:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:57:08,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:08,446 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:08,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:08,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:08,452 INFO L85 PathProgramCache]: Analyzing trace with hash -909137831, now seen corresponding path program 1 times [2024-10-15 14:57:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:08,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473949215] [2024-10-15 14:57:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:08,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:08,643 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:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:08,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473949215] [2024-10-15 14:57:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473949215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:08,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:08,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:57:08,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343572990] [2024-10-15 14:57:08,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:57:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:08,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:57:08,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:57:08,681 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:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:08,727 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2024-10-15 14:57:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:57:08,736 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:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:08,749 INFO L225 Difference]: With dead ends: 58 [2024-10-15 14:57:08,750 INFO L226 Difference]: Without dead ends: 29 [2024-10-15 14:57:08,753 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:08,757 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:08,759 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:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-15 14:57:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-15 14:57:08,796 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:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-15 14:57:08,800 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-10-15 14:57:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:08,801 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-15 14:57:08,801 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:08,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-10-15 14:57:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:57:08,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:08,803 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:08,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:57:08,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:08,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash -229079461, now seen corresponding path program 1 times [2024-10-15 14:57:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205137442] [2024-10-15 14:57:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:09,029 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:09,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:09,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205137442] [2024-10-15 14:57:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205137442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:09,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:09,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397293404] [2024-10-15 14:57:09,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:09,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:09,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:09,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:09,035 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:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:09,110 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-15 14:57:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:09,112 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:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:09,113 INFO L225 Difference]: With dead ends: 42 [2024-10-15 14:57:09,113 INFO L226 Difference]: Without dead ends: 40 [2024-10-15 14:57:09,114 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:09,115 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:09,116 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:09,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-15 14:57:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-10-15 14:57:09,132 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:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-15 14:57:09,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2024-10-15 14:57:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:09,134 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-15 14:57:09,134 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:09,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-15 14:57:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:57:09,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:09,136 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:09,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:57:09,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:09,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash 520476838, now seen corresponding path program 1 times [2024-10-15 14:57:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338987766] [2024-10-15 14:57:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:09,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:09,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:09,289 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:09,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:09,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338987766] [2024-10-15 14:57:09,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338987766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:09,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104807913] [2024-10-15 14:57:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:09,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:09,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:09,296 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:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:09,369 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-10-15 14:57:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:09,370 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:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:09,371 INFO L225 Difference]: With dead ends: 46 [2024-10-15 14:57:09,371 INFO L226 Difference]: Without dead ends: 44 [2024-10-15 14:57:09,371 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:09,372 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.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:09,373 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.1s Time] [2024-10-15 14:57:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-15 14:57:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-10-15 14:57:09,387 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:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-15 14:57:09,390 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2024-10-15 14:57:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:09,390 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-15 14:57:09,391 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:09,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-15 14:57:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-15 14:57:09,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:09,394 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:09,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:57:09,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:09,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1140086011, now seen corresponding path program 1 times [2024-10-15 14:57:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523295372] [2024-10-15 14:57:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:09,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102720031] [2024-10-15 14:57:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:09,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:09,422 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:09,424 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:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:09,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 14:57:09,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:09,628 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:09,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:57:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523295372] [2024-10-15 14:57:09,629 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102720031] [2024-10-15 14:57:09,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102720031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585897533] [2024-10-15 14:57:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:09,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:09,635 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:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:09,715 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-10-15 14:57:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:09,716 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:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:09,717 INFO L225 Difference]: With dead ends: 63 [2024-10-15 14:57:09,717 INFO L226 Difference]: Without dead ends: 50 [2024-10-15 14:57:09,718 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:09,721 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.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:09,721 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.1s Time] [2024-10-15 14:57:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-15 14:57:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-15 14:57:09,735 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:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-10-15 14:57:09,738 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 26 [2024-10-15 14:57:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:09,739 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-10-15 14:57:09,739 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:09,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-10-15 14:57:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-15 14:57:09,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:09,742 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:09,759 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:09,943 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:09,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:09,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash -975701997, now seen corresponding path program 1 times [2024-10-15 14:57:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:09,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314373003] [2024-10-15 14:57:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:09,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299218947] [2024-10-15 14:57:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:09,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:09,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:09,959 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:09,964 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:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:10,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:57:10,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:10,077 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:10,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:57:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314373003] [2024-10-15 14:57:10,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299218947] [2024-10-15 14:57:10,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299218947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:10,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:10,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679094356] [2024-10-15 14:57:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:10,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:10,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:10,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:10,081 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:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:10,161 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-10-15 14:57:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:10,163 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:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:10,164 INFO L225 Difference]: With dead ends: 63 [2024-10-15 14:57:10,164 INFO L226 Difference]: Without dead ends: 61 [2024-10-15 14:57:10,165 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:10,166 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:10,166 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:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-15 14:57:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-10-15 14:57:10,181 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:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-10-15 14:57:10,186 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 33 [2024-10-15 14:57:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:10,186 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-10-15 14:57:10,186 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:10,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-10-15 14:57:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-15 14:57:10,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:10,188 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:10,205 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:57:10,388 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:10,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -928833564, now seen corresponding path program 1 times [2024-10-15 14:57:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357717533] [2024-10-15 14:57:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:10,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547286762] [2024-10-15 14:57:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:10,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:10,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:10,421 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:10,423 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:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:10,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 14:57:10,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:10,580 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:10,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:10,678 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:10,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357717533] [2024-10-15 14:57:10,678 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547286762] [2024-10-15 14:57:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547286762] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:10,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:57:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-15 14:57:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778111145] [2024-10-15 14:57:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:10,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:10,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:57:10,682 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:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:10,756 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-10-15 14:57:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:10,756 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:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:10,759 INFO L225 Difference]: With dead ends: 70 [2024-10-15 14:57:10,759 INFO L226 Difference]: Without dead ends: 68 [2024-10-15 14:57:10,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:57:10,760 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:10,760 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:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-15 14:57:10,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-10-15 14:57:10,778 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:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-10-15 14:57:10,779 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 43 [2024-10-15 14:57:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:10,779 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-10-15 14:57:10,780 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:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-10-15 14:57:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-15 14:57:10,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:10,782 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:10,798 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:57:10,985 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:10,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:10,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -238148106, now seen corresponding path program 1 times [2024-10-15 14:57:10,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:10,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819863668] [2024-10-15 14:57:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:10,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:57:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,148 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:11,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819863668] [2024-10-15 14:57:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819863668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:11,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:57:11,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:57:11,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091680436] [2024-10-15 14:57:11,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:11,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:57:11,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:11,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:57:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:57:11,154 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:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:11,220 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-10-15 14:57:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:57:11,220 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:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:11,221 INFO L225 Difference]: With dead ends: 75 [2024-10-15 14:57:11,221 INFO L226 Difference]: Without dead ends: 63 [2024-10-15 14:57:11,222 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:11,222 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:11,224 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:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-15 14:57:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-15 14:57:11,236 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:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2024-10-15 14:57:11,237 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 49 [2024-10-15 14:57:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:11,238 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2024-10-15 14:57:11,238 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:11,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2024-10-15 14:57:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-15 14:57:11,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:11,240 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:11,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:57:11,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:11,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1374799408, now seen corresponding path program 1 times [2024-10-15 14:57:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616897606] [2024-10-15 14:57:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:11,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666343816] [2024-10-15 14:57:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:11,288 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:11,291 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:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:11,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-15 14:57:11,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:11,671 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:11,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:13,176 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:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616897606] [2024-10-15 14:57:13,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666343816] [2024-10-15 14:57:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666343816] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:13,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:13,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-15 14:57:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433764152] [2024-10-15 14:57:13,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:13,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:57:13,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:13,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:57:13,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:57:13,179 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:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:13,816 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2024-10-15 14:57:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:57:13,817 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:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:13,819 INFO L225 Difference]: With dead ends: 138 [2024-10-15 14:57:13,819 INFO L226 Difference]: Without dead ends: 115 [2024-10-15 14:57:13,819 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:13,820 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:13,820 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:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-15 14:57:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-10-15 14:57:13,851 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:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-10-15 14:57:13,853 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 63 [2024-10-15 14:57:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-10-15 14:57:13,854 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:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-10-15 14:57:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-15 14:57:13,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:13,856 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:13,874 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:14,056 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:14,057 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:14,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2048390162, now seen corresponding path program 1 times [2024-10-15 14:57:14,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:14,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208749974] [2024-10-15 14:57:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:14,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496978478] [2024-10-15 14:57:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:14,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:14,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:14,086 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:14,090 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:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:14,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-15 14:57:14,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:14,412 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:14,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:14,972 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:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208749974] [2024-10-15 14:57:14,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496978478] [2024-10-15 14:57:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496978478] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:14,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:14,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-10-15 14:57:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519404145] [2024-10-15 14:57:14,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:14,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 14:57:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:14,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 14:57:14,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-15 14:57:14,975 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:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:15,631 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2024-10-15 14:57:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 14:57:15,632 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:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:15,634 INFO L225 Difference]: With dead ends: 168 [2024-10-15 14:57:15,634 INFO L226 Difference]: Without dead ends: 136 [2024-10-15 14:57:15,634 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:15,635 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:15,636 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:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-15 14:57:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-10-15 14:57:15,673 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:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-10-15 14:57:15,674 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 74 [2024-10-15 14:57:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:15,674 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-10-15 14:57:15,675 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:15,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-10-15 14:57:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-15 14:57:15,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:15,677 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:15,694 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:15,880 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:15,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:15,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1556827571, now seen corresponding path program 1 times [2024-10-15 14:57:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173289664] [2024-10-15 14:57:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:57:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:57:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:57:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:57:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:57:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:57:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,216 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:16,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:16,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173289664] [2024-10-15 14:57:16,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173289664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:16,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632871688] [2024-10-15 14:57:16,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:16,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:16,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:16,219 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:16,222 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:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:16,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-15 14:57:16,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:16,426 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:16,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:16,799 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:16,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632871688] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:16,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:57:16,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-15 14:57:16,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187797755] [2024-10-15 14:57:16,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:16,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 14:57:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 14:57:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:57:16,802 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:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:16,984 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2024-10-15 14:57:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 14:57:16,985 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:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:16,987 INFO L225 Difference]: With dead ends: 129 [2024-10-15 14:57:16,987 INFO L226 Difference]: Without dead ends: 100 [2024-10-15 14:57:16,987 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:16,988 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:16,988 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:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-15 14:57:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-15 14:57:17,016 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:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2024-10-15 14:57:17,017 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 79 [2024-10-15 14:57:17,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:17,017 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2024-10-15 14:57:17,018 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:17,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2024-10-15 14:57:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-15 14:57:17,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:17,021 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:17,038 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:17,222 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:17,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:17,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash -802122381, now seen corresponding path program 2 times [2024-10-15 14:57:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831447515] [2024-10-15 14:57:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:57:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:57:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:57:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:57:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:57:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:57:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:57:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:57:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-15 14:57:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831447515] [2024-10-15 14:57:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831447515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133593596] [2024-10-15 14:57:17,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:57:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:17,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:17,704 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:17,705 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:17,766 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:57:17,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:57:17,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 14:57:17,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-15 14:57:18,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-15 14:57:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133593596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:18,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:57:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 23 [2024-10-15 14:57:18,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222454029] [2024-10-15 14:57:18,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:18,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-15 14:57:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:18,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-15 14:57:18,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-10-15 14:57:18,861 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 14 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (42), 15 states have call predecessors, (42), 13 states have call successors, (42) [2024-10-15 14:57:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:19,222 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2024-10-15 14:57:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:57:19,223 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 14 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (42), 15 states have call predecessors, (42), 13 states have call successors, (42) Word has length 93 [2024-10-15 14:57:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:19,224 INFO L225 Difference]: With dead ends: 167 [2024-10-15 14:57:19,225 INFO L226 Difference]: Without dead ends: 104 [2024-10-15 14:57:19,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2024-10-15 14:57:19,226 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 60 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:19,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 417 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:57:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-15 14:57:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-10-15 14:57:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.05) internal successors, (63), 63 states have internal predecessors, (63), 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:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2024-10-15 14:57:19,256 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 93 [2024-10-15 14:57:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:19,257 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2024-10-15 14:57:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 14 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (42), 15 states have call predecessors, (42), 13 states have call successors, (42) [2024-10-15 14:57:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2024-10-15 14:57:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-15 14:57:19,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:19,259 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:19,276 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:19,463 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:57:19,464 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:19,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1803901173, now seen corresponding path program 1 times [2024-10-15 14:57:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130158507] [2024-10-15 14:57:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:57:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:57:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:57:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:57:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:57:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:57:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:57:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:57:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-15 14:57:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130158507] [2024-10-15 14:57:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130158507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442276721] [2024-10-15 14:57:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:19,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:19,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:19,647 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:57:19,649 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:57:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:19,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 14:57:19,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-15 14:57:19,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:57:19,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442276721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:57:19,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:57:19,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2024-10-15 14:57:19,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103659127] [2024-10-15 14:57:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:57:19,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:57:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:19,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:57:19,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:57:19,866 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-15 14:57:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:19,958 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2024-10-15 14:57:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:57:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 93 [2024-10-15 14:57:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:19,961 INFO L225 Difference]: With dead ends: 118 [2024-10-15 14:57:19,961 INFO L226 Difference]: Without dead ends: 84 [2024-10-15 14:57:19,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:57:19,962 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:19,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:57:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-15 14:57:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-15 14:57:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-15 14:57:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-10-15 14:57:19,988 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 93 [2024-10-15 14:57:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:19,988 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-10-15 14:57:19,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-15 14:57:19,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-10-15 14:57:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-15 14:57:19,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:19,990 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 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:57:20,007 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:20,190 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:57:20,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:20,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash 334767440, now seen corresponding path program 2 times [2024-10-15 14:57:20,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:20,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264218117] [2024-10-15 14:57:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:20,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331653364] [2024-10-15 14:57:20,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:57:20,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:20,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:20,215 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:57:20,217 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:57:20,277 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:57:20,277 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:57:20,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 14:57:20,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-15 14:57:20,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-15 14:57:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264218117] [2024-10-15 14:57:39,561 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331653364] [2024-10-15 14:57:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331653364] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:39,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-15 14:57:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678540788] [2024-10-15 14:57:39,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:57:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:57:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:57:39,563 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 7 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2024-10-15 14:57:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:39,750 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-10-15 14:57:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:57:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 7 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) Word has length 98 [2024-10-15 14:57:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:39,752 INFO L225 Difference]: With dead ends: 94 [2024-10-15 14:57:39,752 INFO L226 Difference]: Without dead ends: 92 [2024-10-15 14:57:39,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:57:39,753 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:39,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 297 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:57:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-15 14:57:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-15 14:57:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 58 states have internal predecessors, (58), 20 states have call successors, (20), 15 states have call predecessors, (20), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-15 14:57:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-10-15 14:57:39,780 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 98 [2024-10-15 14:57:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:39,781 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-10-15 14:57:39,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 7 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 7 states have call predecessors, (30), 7 states have call successors, (30) [2024-10-15 14:57:39,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-10-15 14:57:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-15 14:57:39,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:39,782 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:39,798 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:57:39,982 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:57:39,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash -943794067, now seen corresponding path program 1 times [2024-10-15 14:57:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748041988] [2024-10-15 14:57:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:57:40,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533528376] [2024-10-15 14:57:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:40,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:40,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:40,018 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:57:40,019 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:57:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:40,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-15 14:57:40,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 29 proven. 71 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:57:40,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 29 proven. 71 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:57:41,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:41,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748041988] [2024-10-15 14:57:41,348 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:57:41,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533528376] [2024-10-15 14:57:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533528376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:41,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:57:41,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-10-15 14:57:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875666120] [2024-10-15 14:57:41,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:41,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-15 14:57:41,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:41,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 14:57:41,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-10-15 14:57:41,350 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 24 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 14 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 11 states have call predecessors, (32), 12 states have call successors, (32) [2024-10-15 14:57:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:41,583 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2024-10-15 14:57:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:57:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 14 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 11 states have call predecessors, (32), 12 states have call successors, (32) Word has length 104 [2024-10-15 14:57:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:41,585 INFO L225 Difference]: With dead ends: 98 [2024-10-15 14:57:41,585 INFO L226 Difference]: Without dead ends: 94 [2024-10-15 14:57:41,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2024-10-15 14:57:41,586 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:41,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 330 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:57:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-15 14:57:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-15 14:57:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.0) internal successors, (59), 59 states have internal predecessors, (59), 20 states have call successors, (20), 16 states have call predecessors, (20), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-15 14:57:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2024-10-15 14:57:41,611 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 104 [2024-10-15 14:57:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:41,612 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2024-10-15 14:57:41,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 14 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 11 states have call predecessors, (32), 12 states have call successors, (32) [2024-10-15 14:57:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2024-10-15 14:57:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-15 14:57:41,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:57:41,614 INFO L215 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:41,632 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:57:41,814 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:57:41,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:57:41,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash -972326764, now seen corresponding path program 1 times [2024-10-15 14:57:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:57:41,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919499921] [2024-10-15 14:57:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:57:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:57:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:57:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:57:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:57:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:57:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:57:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:57:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:57:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:57:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:57:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-15 14:57:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 14:57:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-15 14:57:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:57:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:57:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-15 14:57:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-15 14:57:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-15 14:57:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,254 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:57:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:57:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919499921] [2024-10-15 14:57:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919499921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:57:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394776815] [2024-10-15 14:57:42,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:57:42,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:57:42,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:57:42,256 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:57:42,257 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:57:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:57:42,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-15 14:57:42,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:57:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-15 14:57:42,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:57:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-15 14:57:44,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394776815] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:57:44,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:57:44,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 29 [2024-10-15 14:57:44,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825318696] [2024-10-15 14:57:44,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:57:44,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-15 14:57:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:57:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-15 14:57:44,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2024-10-15 14:57:44,375 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 27 states have internal predecessors, (63), 17 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 16 states have call predecessors, (49), 17 states have call successors, (49) [2024-10-15 14:57:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:57:44,629 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2024-10-15 14:57:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:57:44,630 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 27 states have internal predecessors, (63), 17 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 16 states have call predecessors, (49), 17 states have call successors, (49) Word has length 109 [2024-10-15 14:57:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:57:44,630 INFO L225 Difference]: With dead ends: 94 [2024-10-15 14:57:44,630 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:57:44,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2024-10-15 14:57:44,631 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:57:44,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 342 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:57:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:57:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:57:44,632 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:57:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:57:44,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2024-10-15 14:57:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:57:44,632 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:57:44,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 27 states have internal predecessors, (63), 17 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 16 states have call predecessors, (49), 17 states have call successors, (49) [2024-10-15 14:57:44,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:57:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:57:44,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:57:44,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:57:44,658 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-15 14:57:44,842 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:57:44,845 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:57:44,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:57:45,739 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:57:45,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:57:45 BoogieIcfgContainer [2024-10-15 14:57:45,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:57:45,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:57:45,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:57:45,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:57:45,759 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:08" (3/4) ... [2024-10-15 14:57:45,760 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:57:45,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:57:45,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:57:45,805 INFO L158 Benchmark]: Toolchain (without parser) took 38136.32ms. Allocated memory was 159.4MB in the beginning and 337.6MB in the end (delta: 178.3MB). Free memory was 93.2MB in the beginning and 174.0MB in the end (delta: -80.8MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB. [2024-10-15 14:57:45,806 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:57:45,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.64ms. Allocated memory is still 159.4MB. Free memory was 92.9MB in the beginning and 128.0MB in the end (delta: -35.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 14:57:45,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.25ms. Allocated memory is still 159.4MB. Free memory was 128.0MB in the beginning and 126.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:57:45,806 INFO L158 Benchmark]: Boogie Preprocessor took 48.84ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 125.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:57:45,807 INFO L158 Benchmark]: RCFGBuilder took 307.07ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 111.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 14:57:45,807 INFO L158 Benchmark]: TraceAbstraction took 37393.27ms. Allocated memory was 159.4MB in the beginning and 337.6MB in the end (delta: 178.3MB). Free memory was 110.6MB in the beginning and 177.1MB in the end (delta: -66.5MB). Peak memory consumption was 183.2MB. Max. memory is 16.1GB. [2024-10-15 14:57:45,807 INFO L158 Benchmark]: Witness Printer took 46.92ms. Allocated memory is still 337.6MB. Free memory was 176.1MB in the beginning and 174.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:57:45,809 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 109.1MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.64ms. Allocated memory is still 159.4MB. Free memory was 92.9MB in the beginning and 128.0MB in the end (delta: -35.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.25ms. Allocated memory is still 159.4MB. Free memory was 128.0MB in the beginning and 126.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.84ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 125.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.07ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 111.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 37393.27ms. Allocated memory was 159.4MB in the beginning and 337.6MB in the end (delta: 178.3MB). Free memory was 110.6MB in the beginning and 177.1MB in the end (delta: -66.5MB). Peak memory consumption was 183.2MB. Max. memory is 16.1GB. * Witness Printer took 46.92ms. Allocated memory is still 337.6MB. Free memory was 176.1MB in the beginning and 174.0MB 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: 36.4s, OverallIterations: 15, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 2865 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2319 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1941 IncrementalHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 546 mSDtfsCounter, 1941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1701 GetRequests, 1519 SyntacticMatches, 9 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=8, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 48 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 1732 NumberOfCodeBlocks, 1732 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1927 ConstructedInterpolants, 0 QuantifiedInterpolants, 19021 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2052 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 6268/6871 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: (((((((((((r == 0) && (A == 2)) && (q == 2)) && (d == 1)) && (B == 1)) && (p == 1)) || (((((A == r) && (p == 2)) && (d == 2)) && (q == 0)) && (B == 1))) || ((((((r == 0) && (A == 2)) && (q == 2)) && (p == 2)) && (d == 2)) && (B == 1))) || (((((A == ((long long) r + 1)) && (d == 1)) && (B == 1)) && (q == 1)) && (p == 1))) || (((((A == r) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) || ((((((A == 2) && (r == 2)) && (d == 4)) && (q == 0)) && (B == 1)) && (p == 4))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((A == r) && (p == 2)) && (1 <= r)) && (d == 2)) && (r <= 2)) && (q == 0)) && (B == 1)) || (((((((0 <= A) && (A == r)) && (d == 1)) && (r <= 2)) && (q == 0)) && (B == 1)) && (p == 1))) || ((((((A == 2) && (r == 2)) && (d == 4)) && (q == 0)) && (B == 1)) && (p == 4))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:57:45,848 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