./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b13c7652df725cabbd532da1a8071964fc183988971efb0d5513967afd08dfea --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:49:25,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:49:25,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:49:25,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:49:25,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:49:25,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:49:25,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:49:25,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:49:25,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:49:25,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:49:25,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:49:25,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:49:25,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:49:25,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:49:25,142 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:49:25,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:49:25,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:49:25,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:49:25,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:49:25,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:49:25,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:49:25,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:49:25,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:49:25,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:49:25,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:49:25,151 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:49:25,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:49:25,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:49:25,152 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:49:25,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:49:25,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:49:25,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:49:25,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:49:25,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:49:25,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:49:25,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:49:25,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:49:25,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:49:25,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:49:25,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:49:25,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:49:25,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:49:25,157 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 -> b13c7652df725cabbd532da1a8071964fc183988971efb0d5513967afd08dfea Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:49:25,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:49:25,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:49:25,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:49:25,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:49:25,431 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:49:25,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i [2024-09-11 19:49:26,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:49:26,874 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:49:26,874 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i [2024-09-11 19:49:26,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/00d39b19a/defad45773134c4abb8cd1808d18314a/FLAG289d829e3 [2024-09-11 19:49:27,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/00d39b19a/defad45773134c4abb8cd1808d18314a [2024-09-11 19:49:27,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:49:27,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:49:27,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:49:27,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:49:27,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:49:27,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fd7bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27, skipping insertion in model container [2024-09-11 19:49:27,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:49:27,439 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i[951,964] [2024-09-11 19:49:27,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:49:27,463 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:49:27,475 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i[951,964] [2024-09-11 19:49:27,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:49:27,494 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:49:27,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27 WrapperNode [2024-09-11 19:49:27,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:49:27,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:49:27,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:49:27,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:49:27,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,524 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2024-09-11 19:49:27,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:49:27,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:49:27,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:49:27,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:49:27,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,552 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 19:49:27,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:49:27,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:49:27,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:49:27,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:49:27,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (1/1) ... [2024-09-11 19:49:27,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:49:27,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:27,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 19:49:27,609 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 19:49:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:49:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:49:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:49:27,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:49:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:49:27,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:49:27,720 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:49:27,722 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:49:27,915 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-11 19:49:27,916 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:49:27,937 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:49:27,937 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:49:27,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:49:27 BoogieIcfgContainer [2024-09-11 19:49:27,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:49:27,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:49:27,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:49:27,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:49:27,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:49:27" (1/3) ... [2024-09-11 19:49:27,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df5eb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:49:27, skipping insertion in model container [2024-09-11 19:49:27,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:27" (2/3) ... [2024-09-11 19:49:27,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df5eb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:49:27, skipping insertion in model container [2024-09-11 19:49:27,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:49:27" (3/3) ... [2024-09-11 19:49:27,951 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound2.i [2024-09-11 19:49:27,966 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:49:27,968 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:49:28,013 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:49:28,020 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74bd3319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:49:28,020 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:49:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:49:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 19:49:28,028 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:28,029 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:28,029 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:28,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:28,035 INFO L85 PathProgramCache]: Analyzing trace with hash 334653711, now seen corresponding path program 1 times [2024-09-11 19:49:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508884120] [2024-09-11 19:49:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:49:28,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508884120] [2024-09-11 19:49:28,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508884120] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:28,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:28,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:49:28,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956818925] [2024-09-11 19:49:28,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:28,195 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:49:28,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:28,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:49:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:49:28,213 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:49:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:28,233 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2024-09-11 19:49:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:49:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-09-11 19:49:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:28,241 INFO L225 Difference]: With dead ends: 34 [2024-09-11 19:49:28,241 INFO L226 Difference]: Without dead ends: 16 [2024-09-11 19:49:28,244 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:49:28,248 INFO L434 NwaCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:28,250 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:49:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-11 19:49:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-11 19:49:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:49:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-09-11 19:49:28,283 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2024-09-11 19:49:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:28,285 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-09-11 19:49:28,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:49:28,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-09-11 19:49:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:49:28,286 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:28,286 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:28,287 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:49:28,287 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:28,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash -401566674, now seen corresponding path program 1 times [2024-09-11 19:49:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:28,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244578106] [2024-09-11 19:49:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:28,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:49:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542700012] [2024-09-11 19:49:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:28,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:28,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:28,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:49:28,330 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 19:49:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:28,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 19:49:28,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:49:28,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:49:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:28,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244578106] [2024-09-11 19:49:28,604 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:49:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542700012] [2024-09-11 19:49:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542700012] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:28,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:28,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:49:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202821490] [2024-09-11 19:49:28,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:28,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:49:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:49:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:49:28,610 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:49:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:28,717 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-09-11 19:49:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:49:28,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:49:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:28,719 INFO L225 Difference]: With dead ends: 27 [2024-09-11 19:49:28,720 INFO L226 Difference]: Without dead ends: 24 [2024-09-11 19:49:28,721 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:49:28,722 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:28,723 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:49:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-11 19:49:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-11 19:49:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:49:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-11 19:49:28,735 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 10 [2024-09-11 19:49:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:28,736 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-11 19:49:28,736 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:49:28,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-11 19:49:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 19:49:28,742 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:28,742 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:28,758 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 19:49:28,942 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:28,943 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:28,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:28,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1989427041, now seen corresponding path program 1 times [2024-09-11 19:49:28,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:28,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982411612] [2024-09-11 19:49:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:29,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:49:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:49:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982411612] [2024-09-11 19:49:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982411612] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:29,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:29,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:49:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539471174] [2024-09-11 19:49:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:29,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:49:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:29,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:49:29,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:49:29,335 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:49:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:29,366 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-09-11 19:49:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:49:29,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-11 19:49:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:29,368 INFO L225 Difference]: With dead ends: 48 [2024-09-11 19:49:29,368 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 19:49:29,369 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:49:29,370 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:29,371 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:49:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 19:49:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-11 19:49:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:49:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-11 19:49:29,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2024-09-11 19:49:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:29,384 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-11 19:49:29,384 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:49:29,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-11 19:49:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 19:49:29,387 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:29,387 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:29,387 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:49:29,387 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:29,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -989864836, now seen corresponding path program 1 times [2024-09-11 19:49:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:29,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758611197] [2024-09-11 19:49:29,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:49:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183242944] [2024-09-11 19:49:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:29,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:29,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:29,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:49:29,433 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 19:49:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:29,540 WARN L260 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-11 19:49:29,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:49:29,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:05,854 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:50:22,040 WARN L293 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 11 DAG size of output: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:50:38,090 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:50:42,102 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_ULTIMATE.start_main_~b~0#1| 2147483648))) (let ((.cse1 (* 2 .cse2)) (.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296))) (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) .cse0)) (< .cse1 (+ |c_ULTIMATE.start_main_~r~0#1| 1)) (< (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296) (mod |c_ULTIMATE.start_main_~b~0#1| 4294967296)) (= .cse1 (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296)) (= (mod (+ |c_ULTIMATE.start_main_~r~0#1| (* 2 .cse2 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse0)))) is different from true [2024-09-11 19:50:54,142 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:51:14,200 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:51:34,242 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:51:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-11 19:51:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:51:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758611197] [2024-09-11 19:51:34,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:51:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183242944] [2024-09-11 19:51:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183242944] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:51:34,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:51:34,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2024-09-11 19:51:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37941276] [2024-09-11 19:51:34,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:51:34,250 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 19:51:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:51:34,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 19:51:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=272, Unknown=1, NotChecked=34, Total=380 [2024-09-11 19:51:34,256 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 18 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:51:38,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:51:43,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:51:47,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:51:52,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:51:56,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:52:02,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:52:08,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:52:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:52:08,470 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2024-09-11 19:52:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 19:52:08,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 18 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-09-11 19:52:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:52:08,473 INFO L225 Difference]: With dead ends: 73 [2024-09-11 19:52:08,473 INFO L226 Difference]: Without dead ends: 45 [2024-09-11 19:52:08,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=139, Invalid=464, Unknown=1, NotChecked=46, Total=650 [2024-09-11 19:52:08,475 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 17 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2024-09-11 19:52:08,475 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 218 Invalid, 7 Unknown, 50 Unchecked, 32.8s Time] [2024-09-11 19:52:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-11 19:52:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-11 19:52:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:52:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-09-11 19:52:08,487 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2024-09-11 19:52:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:52:08,488 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-09-11 19:52:08,488 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 18 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:52:08,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:52:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-09-11 19:52:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 19:52:08,489 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:52:08,489 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:52:08,498 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:52:08,693 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:52:08,694 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:52:08,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:52:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash -305514894, now seen corresponding path program 2 times [2024-09-11 19:52:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:52:08,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785413109] [2024-09-11 19:52:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:52:08,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:52:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:52:09,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:52:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:52:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 19:52:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:52:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785413109] [2024-09-11 19:52:09,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785413109] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:52:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434746571] [2024-09-11 19:52:09,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:52:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:52:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:52:09,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:52:09,065 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 19:52:09,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:52:09,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:52:09,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-11 19:52:09,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:52:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:52:09,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:52:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434746571] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:52:09,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:52:09,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2024-09-11 19:52:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924756048] [2024-09-11 19:52:09,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:52:09,573 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 19:52:09,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:52:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 19:52:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:52:09,574 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:52:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:52:09,813 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2024-09-11 19:52:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:52:09,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-09-11 19:52:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:52:09,815 INFO L225 Difference]: With dead ends: 73 [2024-09-11 19:52:09,815 INFO L226 Difference]: Without dead ends: 53 [2024-09-11 19:52:09,815 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:52:09,816 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:52:09,816 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 107 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:52:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-11 19:52:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2024-09-11 19:52:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:52:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-09-11 19:52:09,830 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2024-09-11 19:52:09,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:52:09,830 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-09-11 19:52:09,831 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:52:09,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:52:09,831 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-09-11 19:52:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:52:09,832 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:52:09,832 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 19:52:09,840 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:52:10,032 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:52:10,033 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:52:10,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:52:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash -620785398, now seen corresponding path program 3 times [2024-09-11 19:52:10,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:52:10,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585699273] [2024-09-11 19:52:10,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:52:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:52:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:52:10,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 19:52:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:52:10,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:52:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:52:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:52:10,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:52:10,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585699273] [2024-09-11 19:52:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585699273] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:52:10,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340166242] [2024-09-11 19:52:10,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:52:10,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:52:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:52:10,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:52:10,673 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 19:52:13,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 19:52:13,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:52:13,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-11 19:52:13,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:52:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:52:14,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:53:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 3 refuted. 2 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 19:53:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340166242] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:53:55,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:53:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26 [2024-09-11 19:53:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426727869] [2024-09-11 19:53:55,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:53:55,868 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-11 19:53:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:53:55,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-11 19:53:55,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=542, Unknown=10, NotChecked=0, Total=650 [2024-09-11 19:53:55,869 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)