./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.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 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:49:17,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:49:17,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:49:17,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:49:17,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:49:17,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:49:17,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:49:17,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:49:17,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:49:17,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:49:17,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:49:17,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:49:17,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:49:17,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:49:17,552 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:49:17,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:49:17,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:49:17,552 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:49:17,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:49:17,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:49:17,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:49:17,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:49:17,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:49:17,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:49:17,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:49:17,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:49:17,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:49:17,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:49:17,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:49:17,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:49:17,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:49:17,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:49:17,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:49:17,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:49:17,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:49:17,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:49:17,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:49:17,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:49:17,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:49:17,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:49:17,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:49:17,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:49:17,558 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 -> 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:49:17,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:49:17,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:49:17,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:49:17,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:49:17,848 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:49:17,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-09-25 10:49:19,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:49:19,190 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:49:19,191 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-09-25 10:49:19,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/432a87f02/61a745baf5b3474bbf80e379c4ef6ab0/FLAGd15657113 [2024-09-25 10:49:19,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/432a87f02/61a745baf5b3474bbf80e379c4ef6ab0 [2024-09-25 10:49:19,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:49:19,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:49:19,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:49:19,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:49:19,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:49:19,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7401b604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19, skipping insertion in model container [2024-09-25 10:49:19,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:49:19,761 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/divbin_unwindbound5.i[950,963] [2024-09-25 10:49:19,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:49:19,786 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:49:19,797 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/divbin_unwindbound5.i[950,963] [2024-09-25 10:49:19,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:49:19,815 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:49:19,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19 WrapperNode [2024-09-25 10:49:19,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:49:19,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:49:19,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:49:19,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:49:19,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,832 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:49:19,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:49:19,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:49:19,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:49:19,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:49:19,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,854 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:49:19,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:49:19,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:49:19,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:49:19,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:49:19,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:49:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:19,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:49:19,905 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:49:19,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:49:19,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:49:19,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:49:19,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:49:19,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:49:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:49:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:49:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:49:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:49:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:49:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:49:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:49:19,986 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:49:19,988 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:49:20,140 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 10:49:20,141 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:49:20,160 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:49:20,160 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:49:20,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:49:20 BoogieIcfgContainer [2024-09-25 10:49:20,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:49:20,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:49:20,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:49:20,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:49:20,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:49:19" (1/3) ... [2024-09-25 10:49:20,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64084b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:49:20, skipping insertion in model container [2024-09-25 10:49:20,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (2/3) ... [2024-09-25 10:49:20,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64084b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:49:20, skipping insertion in model container [2024-09-25 10:49:20,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:49:20" (3/3) ... [2024-09-25 10:49:20,170 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2024-09-25 10:49:20,185 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:49:20,185 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:49:20,235 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:49:20,241 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;@72981b28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:49:20,241 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:49:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:49:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:49:20,250 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:20,251 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:20,253 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:20,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1602480078, now seen corresponding path program 1 times [2024-09-25 10:49:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:20,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031578363] [2024-09-25 10:49:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,385 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031578363] [2024-09-25 10:49:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031578363] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:49:20,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662636350] [2024-09-25 10:49:20,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:20,414 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:49:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:20,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:49:20,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:49:20,435 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:20,522 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2024-09-25 10:49:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:49:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 10:49:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:20,539 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:49:20,539 INFO L226 Difference]: Without dead ends: 28 [2024-09-25 10:49:20,541 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-25 10:49:20,544 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:20,545 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-25 10:49:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-09-25 10:49:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:49:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-09-25 10:49:20,603 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-09-25 10:49:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:20,604 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-09-25 10:49:20,605 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-09-25 10:49:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:49:20,610 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:20,610 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:20,610 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:49:20,611 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:20,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash 610811680, now seen corresponding path program 1 times [2024-09-25 10:49:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:20,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271407801] [2024-09-25 10:49:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:20,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:20,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271407801] [2024-09-25 10:49:20,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271407801] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:20,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:49:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607103713] [2024-09-25 10:49:20,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:20,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:49:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:49:20,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:49:20,808 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:20,887 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-09-25 10:49:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:49:20,891 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-25 10:49:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:20,892 INFO L225 Difference]: With dead ends: 41 [2024-09-25 10:49:20,892 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 10:49:20,893 INFO L433 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-09-25 10:49:20,894 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:20,894 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 10:49:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-25 10:49:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:49:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-25 10:49:20,906 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2024-09-25 10:49:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:20,908 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-25 10:49:20,908 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-25 10:49:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:49:20,909 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:20,909 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:20,909 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:49:20,910 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:20,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1424295131, now seen corresponding path program 1 times [2024-09-25 10:49:20,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:20,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141510956] [2024-09-25 10:49:20,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:21,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:21,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141510956] [2024-09-25 10:49:21,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141510956] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:21,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:21,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:49:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067478335] [2024-09-25 10:49:21,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:21,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:49:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:49:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:49:21,086 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:21,173 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-09-25 10:49:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:49:21,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-09-25 10:49:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:21,174 INFO L225 Difference]: With dead ends: 40 [2024-09-25 10:49:21,174 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 10:49:21,174 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:49:21,175 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:21,175 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 77 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 10:49:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-25 10:49:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:49:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-25 10:49:21,192 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2024-09-25 10:49:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:21,193 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-25 10:49:21,193 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:21,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-25 10:49:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:49:21,194 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:21,194 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:21,194 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:49:21,194 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:21,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1426082591, now seen corresponding path program 1 times [2024-09-25 10:49:21,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:21,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386449460] [2024-09-25 10:49:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:21,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:49:21,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255843819] [2024-09-25 10:49:21,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:21,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:21,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:21,224 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:49:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:49:21,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:21,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:49:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386449460] [2024-09-25 10:49:21,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:49:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255843819] [2024-09-25 10:49:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255843819] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:21,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:21,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:49:21,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920210392] [2024-09-25 10:49:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:21,338 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:49:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:49:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:49:21,339 INFO L87 Difference]: Start difference. First operand 32 states and 39 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 10:49:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:21,388 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-09-25 10:49:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:49:21,388 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-25 10:49:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:21,390 INFO L225 Difference]: With dead ends: 44 [2024-09-25 10:49:21,390 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 10:49:21,390 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:49:21,392 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:21,393 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:49:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 10:49:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-09-25 10:49:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:49:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-09-25 10:49:21,403 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 25 [2024-09-25 10:49:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:21,403 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-09-25 10:49:21,404 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 10:49:21,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-09-25 10:49:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:49:21,405 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:21,405 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:21,418 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:49:21,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:21,606 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:21,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1945714758, now seen corresponding path program 1 times [2024-09-25 10:49:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769081372] [2024-09-25 10:49:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:49:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:21,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:21,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769081372] [2024-09-25 10:49:21,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769081372] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:49:21,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813575153] [2024-09-25 10:49:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:21,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:21,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:21,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:21,766 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:49:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:49:21,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:21,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:49:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813575153] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:49:21,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:49:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-09-25 10:49:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965830440] [2024-09-25 10:49:21,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:49:21,928 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:49:21,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:49:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:49:21,929 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-25 10:49:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:22,081 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2024-09-25 10:49:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 10:49:22,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 34 [2024-09-25 10:49:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:22,083 INFO L225 Difference]: With dead ends: 111 [2024-09-25 10:49:22,083 INFO L226 Difference]: Without dead ends: 104 [2024-09-25 10:49:22,084 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:49:22,085 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 72 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:22,085 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 95 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-25 10:49:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2024-09-25 10:49:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 10:49:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2024-09-25 10:49:22,105 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 34 [2024-09-25 10:49:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:22,106 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2024-09-25 10:49:22,106 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-25 10:49:22,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2024-09-25 10:49:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:49:22,107 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:22,107 INFO L216 NwaCegarLoop]: trace histogram [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-09-25 10:49:22,121 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-25 10:49:22,307 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:22,308 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:22,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1947502218, now seen corresponding path program 1 times [2024-09-25 10:49:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:22,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436701062] [2024-09-25 10:49:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:49:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:22,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:22,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436701062] [2024-09-25 10:49:22,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436701062] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:22,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:22,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:49:22,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561765560] [2024-09-25 10:49:22,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:22,523 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:49:22,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:22,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:49:22,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:49:22,524 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:49:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:22,583 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2024-09-25 10:49:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:49:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 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 34 [2024-09-25 10:49:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:22,584 INFO L225 Difference]: With dead ends: 145 [2024-09-25 10:49:22,586 INFO L226 Difference]: Without dead ends: 75 [2024-09-25 10:49:22,587 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:49:22,587 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:22,587 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:49:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-25 10:49:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-09-25 10:49:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 58 states have internal predecessors, (72), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:49:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2024-09-25 10:49:22,603 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 34 [2024-09-25 10:49:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:22,604 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2024-09-25 10:49:22,604 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:49:22,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2024-09-25 10:49:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 10:49:22,605 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:22,605 INFO L216 NwaCegarLoop]: trace histogram [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-09-25 10:49:22,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:49:22,605 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:22,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1464105851, now seen corresponding path program 1 times [2024-09-25 10:49:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:22,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725054810] [2024-09-25 10:49:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:49:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:49:22,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:22,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725054810] [2024-09-25 10:49:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725054810] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:49:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114837732] [2024-09-25 10:49:22,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:22,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:22,700 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:49:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:49:22,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:49:22,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:49:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:49:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114837732] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:49:22,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:49:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-25 10:49:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717345585] [2024-09-25 10:49:22,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:49:22,822 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:49:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:22,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:49:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:49:22,824 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-25 10:49:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:22,920 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2024-09-25 10:49:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:49:22,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 36 [2024-09-25 10:49:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:22,922 INFO L225 Difference]: With dead ends: 128 [2024-09-25 10:49:22,922 INFO L226 Difference]: Without dead ends: 77 [2024-09-25 10:49:22,922 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:49:22,923 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:22,923 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 88 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-25 10:49:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-09-25 10:49:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 60 states have internal predecessors, (72), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:49:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-09-25 10:49:22,936 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 36 [2024-09-25 10:49:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:22,936 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-09-25 10:49:22,936 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-25 10:49:22,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-09-25 10:49:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 10:49:22,940 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:22,940 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:22,952 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:49:23,140 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:49:23,141 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:23,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1516658666, now seen corresponding path program 1 times [2024-09-25 10:49:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264521346] [2024-09-25 10:49:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:49:23,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846337137] [2024-09-25 10:49:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:23,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:23,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:23,181 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:49:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:23,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 10:49:23,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:49:23,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:49:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264521346] [2024-09-25 10:49:36,289 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:49:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846337137] [2024-09-25 10:49:36,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846337137] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:49:36,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:49:36,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-25 10:49:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45427211] [2024-09-25 10:49:36,291 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 10:49:36,291 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:49:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:49:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2024-09-25 10:49:36,292 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:49:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:36,361 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2024-09-25 10:49:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:49:36,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-09-25 10:49:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:36,362 INFO L225 Difference]: With dead ends: 90 [2024-09-25 10:49:36,362 INFO L226 Difference]: Without dead ends: 86 [2024-09-25 10:49:36,362 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=34, Invalid=119, Unknown=3, NotChecked=0, Total=156 [2024-09-25 10:49:36,363 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:36,364 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 133 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:49:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-25 10:49:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-09-25 10:49:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 58 states have internal predecessors, (68), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:49:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2024-09-25 10:49:36,376 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 37 [2024-09-25 10:49:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:36,376 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2024-09-25 10:49:36,376 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:49:36,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2024-09-25 10:49:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 10:49:36,380 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:36,381 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:36,388 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:49:36,581 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:36,581 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:36,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1803442657, now seen corresponding path program 2 times [2024-09-25 10:49:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:36,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628227176] [2024-09-25 10:49:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:37,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:37,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:37,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:37,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 10:49:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:37,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 10:49:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 10:49:37,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:37,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628227176] [2024-09-25 10:49:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628227176] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:49:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892932225] [2024-09-25 10:49:37,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:49:37,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:37,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:37,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:37,037 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:49:37,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:49:37,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:49:37,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 10:49:37,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:49:37,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:49:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:49:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892932225] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:49:38,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:49:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 9] total 24 [2024-09-25 10:49:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635185859] [2024-09-25 10:49:38,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:49:38,445 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 10:49:38,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 10:49:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:49:38,446 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 19 states have internal predecessors, (62), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-25 10:49:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:39,307 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2024-09-25 10:49:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 10:49:39,307 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 19 states have internal predecessors, (62), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 46 [2024-09-25 10:49:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:39,308 INFO L225 Difference]: With dead ends: 118 [2024-09-25 10:49:39,308 INFO L226 Difference]: Without dead ends: 65 [2024-09-25 10:49:39,309 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 10:49:39,309 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:39,309 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 245 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:49:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-25 10:49:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2024-09-25 10:49:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:49:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-09-25 10:49:39,325 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 46 [2024-09-25 10:49:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:39,326 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-09-25 10:49:39,326 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 19 states have internal predecessors, (62), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-25 10:49:39,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-09-25 10:49:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 10:49:39,327 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:39,327 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-09-25 10:49:39,340 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:49:39,527 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:39,528 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:39,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:39,529 INFO L85 PathProgramCache]: Analyzing trace with hash 182266171, now seen corresponding path program 1 times [2024-09-25 10:49:39,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:39,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42284269] [2024-09-25 10:49:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:39,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:49:39,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809209293] [2024-09-25 10:49:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:39,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:39,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:39,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:39,559 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:49:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:40,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-25 10:49:40,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 10:49:41,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:50:37,837 WARN L293 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:51:30,276 WARN L293 SmtUtils]: Spent 12.24s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:51:54,242 WARN L293 SmtUtils]: Spent 16.20s on a formula simplification. DAG size of input: 55 DAG size of output: 30 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2024-09-25 10:52:20,119 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:52:30,678 WARN L293 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:53:21,822 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:54:03,120 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~b~0 2147483648))) (or (= (mod c_main_~B~0 4294967296) .cse0) (let ((.cse8 (* c_main_~b~0 c_main_~q~0))) (let ((.cse5 (* 2 .cse0)) (.cse3 (mod .cse8 2147483648)) (.cse6 (div .cse0 2))) (let ((.cse1 (not (= (mod (+ (* 2147483647 c_main_~q~0 .cse0) .cse8) 2147483648) 0))) (.cse2 (= (* .cse3 2) (mod (+ (* c_main_~q~0 .cse6 4) (* (mod c_main_~b~0 2) 4294967295)) 4294967296))) (.cse7 (< .cse5 (+ (mod c_main_~b~0 4294967296) 1)))) (and (or .cse1 .cse2 (< .cse3 1) (< (let ((.cse4 (mod (* c_main_~q~0 .cse0) 2147483648))) (+ (* (div (+ (- 2147483649) .cse4 .cse0) 2147483648) 4294967296) (mod (* 4294967295 .cse0) 4294967296) (* (div (+ .cse3 (* (- 1) .cse4)) 2147483648) 4294967296) .cse5)) (+ .cse6 4294967297)) .cse7) (or .cse1 .cse2 .cse7))))))) is different from false