./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound50.c --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/cohendiv-ll_unwindbound50.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cf0abd1bd1b4ed3cb492af2ceaa5e063719310ace8aba62ab225fe204180938 --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:44:04,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:44:04,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:44:04,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:44:04,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:44:04,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:44:04,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:44:04,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:44:04,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:44:04,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:44:04,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:44:04,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:44:04,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:44:04,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:44:04,412 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:44:04,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:44:04,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:44:04,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:44:04,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:44:04,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:44:04,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:44:04,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:44:04,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:44:04,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:44:04,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:44:04,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:44:04,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:44:04,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:44:04,421 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:44:04,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:44:04,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:44:04,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:44:04,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:44:04,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:44:04,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:44:04,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:44:04,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:44:04,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:44:04,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:44:04,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:44:04,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:44:04,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:44:04,424 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 -> 9cf0abd1bd1b4ed3cb492af2ceaa5e063719310ace8aba62ab225fe204180938 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:44:04,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:44:04,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:44:04,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:44:04,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:44:04,677 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:44:04,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound50.c [2024-09-25 10:44:05,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:44:06,098 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:44:06,099 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound50.c [2024-09-25 10:44:06,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c76304499/7145b4f5ce0c4bca8ee1d2b66524dcc4/FLAG9d3662a2a [2024-09-25 10:44:06,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c76304499/7145b4f5ce0c4bca8ee1d2b66524dcc4 [2024-09-25 10:44:06,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:44:06,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:44:06,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:44:06,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:44:06,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:44:06,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3881d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06, skipping insertion in model container [2024-09-25 10:44:06,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:44:06,251 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/cohendiv-ll_unwindbound50.c[576,589] [2024-09-25 10:44:06,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:44:06,271 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:44:06,278 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/cohendiv-ll_unwindbound50.c[576,589] [2024-09-25 10:44:06,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:44:06,302 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:44:06,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06 WrapperNode [2024-09-25 10:44:06,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:44:06,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:44:06,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:44:06,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:44:06,310 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:44:06" (1/1) ... [2024-09-25 10:44:06,314 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:44:06" (1/1) ... [2024-09-25 10:44:06,319 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:44:06,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:44:06,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:44:06,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:44:06,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:44:06,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,334 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:44:06,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:44:06,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:44:06,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:44:06,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:44:06,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (1/1) ... [2024-09-25 10:44:06,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:44:06,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:06,377 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:44:06,379 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:44:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:44:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:44:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:44:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:44:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:44:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:44:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:44:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:44:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:44:06,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:44:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:44:06,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:44:06,457 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:44:06,458 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:44:06,585 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:44:06,585 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:44:06,605 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:44:06,606 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:44:06,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:44:06 BoogieIcfgContainer [2024-09-25 10:44:06,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:44:06,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:44:06,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:44:06,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:44:06,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:44:06" (1/3) ... [2024-09-25 10:44:06,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ac2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:44:06, skipping insertion in model container [2024-09-25 10:44:06,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:06" (2/3) ... [2024-09-25 10:44:06,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ac2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:44:06, skipping insertion in model container [2024-09-25 10:44:06,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:44:06" (3/3) ... [2024-09-25 10:44:06,615 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound50.c [2024-09-25 10:44:06,630 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:44:06,630 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:44:06,690 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:44:06,695 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;@2c9d5ed6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:44:06,695 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:44:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 10:44:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:44:06,702 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:06,703 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:06,703 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:06,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash -166019731, now seen corresponding path program 1 times [2024-09-25 10:44:06,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:06,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565839060] [2024-09-25 10:44:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:06,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:06,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:06,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:44:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:06,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:06,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565839060] [2024-09-25 10:44:06,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565839060] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:06,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:44:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261348111] [2024-09-25 10:44:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:06,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:44:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:44:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:44:06,858 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:44:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:06,941 INFO L93 Difference]: Finished difference Result 65 states and 98 transitions. [2024-09-25 10:44:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:44:06,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:44:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:06,950 INFO L225 Difference]: With dead ends: 65 [2024-09-25 10:44:06,950 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 10:44:06,953 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:44:06,955 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:06,956 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:44:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 10:44:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-25 10:44:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:44:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-25 10:44:06,984 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2024-09-25 10:44:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:06,985 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-25 10:44:06,985 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:44:06,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-25 10:44:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:44:06,986 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:06,986 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:06,986 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:44:06,986 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:06,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1899526296, now seen corresponding path program 1 times [2024-09-25 10:44:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790084000] [2024-09-25 10:44:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:07,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:07,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:44:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:07,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790084000] [2024-09-25 10:44:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790084000] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:07,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:07,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:44:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271487884] [2024-09-25 10:44:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:07,168 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:44:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:44:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:44:07,169 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:44:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:07,268 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-09-25 10:44:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:44:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-09-25 10:44:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:07,269 INFO L225 Difference]: With dead ends: 41 [2024-09-25 10:44:07,269 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 10:44:07,269 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:44:07,270 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:07,270 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:44:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 10:44:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-25 10:44:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:44:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-25 10:44:07,284 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2024-09-25 10:44:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:07,285 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-25 10:44:07,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:44:07,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-25 10:44:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:44:07,287 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:07,287 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:07,287 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:44:07,287 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:07,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1901015846, now seen corresponding path program 1 times [2024-09-25 10:44:07,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:07,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403040218] [2024-09-25 10:44:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:07,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:44:07,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457039969] [2024-09-25 10:44:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:07,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:07,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:07,311 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:44:07,312 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:44:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:07,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:44:07,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:07,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:44:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403040218] [2024-09-25 10:44:07,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:44:07,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457039969] [2024-09-25 10:44:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457039969] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:07,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:07,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:44:07,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675709618] [2024-09-25 10:44:07,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:07,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:44:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:07,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:44:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:44:07,428 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:44:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:07,478 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-25 10:44:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:44:07,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-25 10:44:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:07,480 INFO L225 Difference]: With dead ends: 44 [2024-09-25 10:44:07,480 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 10:44:07,480 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:44:07,481 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:07,481 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:44:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 10:44:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-09-25 10:44:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:44:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-09-25 10:44:07,494 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 17 [2024-09-25 10:44:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:07,495 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-09-25 10:44:07,495 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:44:07,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-09-25 10:44:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:44:07,496 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:07,497 INFO L216 NwaCegarLoop]: trace histogram [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:44:07,509 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:44:07,697 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:07,698 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:07,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1706287866, now seen corresponding path program 1 times [2024-09-25 10:44:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647806555] [2024-09-25 10:44:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:44:07,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173953608] [2024-09-25 10:44:07,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:07,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:07,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:07,722 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:44:07,723 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:44:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:07,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:44:07,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:07,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:44:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647806555] [2024-09-25 10:44:07,809 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:44:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173953608] [2024-09-25 10:44:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173953608] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:07,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:44:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122681510] [2024-09-25 10:44:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:07,809 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:44:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:07,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:44:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:44:07,810 INFO L87 Difference]: Start difference. First operand 39 states and 48 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), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:44:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:07,865 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-09-25 10:44:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:44:07,865 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), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 10:44:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:07,866 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:44:07,866 INFO L226 Difference]: Without dead ends: 54 [2024-09-25 10:44:07,867 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:44:07,867 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:07,867 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:44:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-25 10:44:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-09-25 10:44:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-25 10:44:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-09-25 10:44:07,875 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 22 [2024-09-25 10:44:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:07,875 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-09-25 10:44:07,875 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), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:44:07,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-09-25 10:44:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 10:44:07,876 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:07,877 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:07,894 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:44:08,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:08,078 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:08,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1856957465, now seen corresponding path program 1 times [2024-09-25 10:44:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321248048] [2024-09-25 10:44:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:44:08,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552441973] [2024-09-25 10:44:08,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:08,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:08,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:08,109 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:44:08,110 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:44:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:44:08,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:44:08,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:44:08,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321248048] [2024-09-25 10:44:08,191 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:44:08,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552441973] [2024-09-25 10:44:08,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552441973] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:08,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:08,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:44:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58866887] [2024-09-25 10:44:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:08,191 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:44:08,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:44:08,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:44:08,192 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 10:44:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:08,252 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-09-25 10:44:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:44:08,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-25 10:44:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:08,254 INFO L225 Difference]: With dead ends: 82 [2024-09-25 10:44:08,254 INFO L226 Difference]: Without dead ends: 80 [2024-09-25 10:44:08,254 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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:44:08,255 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:08,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:44:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-25 10:44:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-09-25 10:44:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:44:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2024-09-25 10:44:08,277 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 30 [2024-09-25 10:44:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:08,277 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2024-09-25 10:44:08,277 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 10:44:08,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2024-09-25 10:44:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 10:44:08,278 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:08,278 INFO L216 NwaCegarLoop]: trace histogram [3, 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:44:08,291 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 10:44:08,478 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:08,479 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:08,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1900127414, now seen corresponding path program 1 times [2024-09-25 10:44:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729878563] [2024-09-25 10:44:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:44:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:44:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:44:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:44:08,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:08,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729878563] [2024-09-25 10:44:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729878563] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:08,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:08,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:44:08,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872351535] [2024-09-25 10:44:08,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:08,629 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:44:08,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:08,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:44:08,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:44:08,630 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:44:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:08,744 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2024-09-25 10:44:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:44:08,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-09-25 10:44:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:08,751 INFO L225 Difference]: With dead ends: 112 [2024-09-25 10:44:08,751 INFO L226 Difference]: Without dead ends: 77 [2024-09-25 10:44:08,754 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:44:08,754 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:08,755 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:44:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-25 10:44:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-09-25 10:44:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:44:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2024-09-25 10:44:08,775 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 33 [2024-09-25 10:44:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:08,776 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2024-09-25 10:44:08,776 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:44:08,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2024-09-25 10:44:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:44:08,777 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:08,777 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:08,777 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:44:08,777 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:08,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2073680743, now seen corresponding path program 1 times [2024-09-25 10:44:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342612023] [2024-09-25 10:44:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:44:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:44:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:44:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:44:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:44:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:44:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342612023] [2024-09-25 10:44:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342612023] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:08,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:08,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-25 10:44:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623534337] [2024-09-25 10:44:08,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:08,968 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:44:08,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:08,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:44:08,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:44:08,969 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 10:44:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:09,101 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-09-25 10:44:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:44:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-25 10:44:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:09,102 INFO L225 Difference]: With dead ends: 83 [2024-09-25 10:44:09,102 INFO L226 Difference]: Without dead ends: 81 [2024-09-25 10:44:09,103 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:44:09,103 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:09,103 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 121 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:44:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-25 10:44:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-25 10:44:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:44:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-09-25 10:44:09,114 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 40 [2024-09-25 10:44:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:09,114 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-09-25 10:44:09,114 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 10:44:09,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-09-25 10:44:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 10:44:09,117 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:09,117 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:09,118 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:44:09,118 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:09,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash -930915559, now seen corresponding path program 1 times [2024-09-25 10:44:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970203502] [2024-09-25 10:44:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:44:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:44:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:44:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:44:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:44:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:44:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:44:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970203502] [2024-09-25 10:44:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970203502] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:44:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868162289] [2024-09-25 10:44:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:09,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:09,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:09,277 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:44:09,278 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:44:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:44:09,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:44:09,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:44:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868162289] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:09,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:44:09,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-09-25 10:44:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008161687] [2024-09-25 10:44:09,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:09,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:44:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:44:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:44:09,389 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 10:44:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:09,462 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-09-25 10:44:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:44:09,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-09-25 10:44:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:09,464 INFO L225 Difference]: With dead ends: 94 [2024-09-25 10:44:09,464 INFO L226 Difference]: Without dead ends: 92 [2024-09-25 10:44:09,464 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:44:09,465 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:09,465 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 185 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:44:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-25 10:44:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-09-25 10:44:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 56 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-25 10:44:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-09-25 10:44:09,480 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 46 [2024-09-25 10:44:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:09,481 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-09-25 10:44:09,481 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 10:44:09,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-09-25 10:44:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 10:44:09,483 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:09,483 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:09,496 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:44:09,686 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:44:09,686 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:09,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash -872582608, now seen corresponding path program 1 times [2024-09-25 10:44:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243003386] [2024-09-25 10:44:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:44:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:44:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:44:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:44:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:44:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:44:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:44:09,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:09,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243003386] [2024-09-25 10:44:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243003386] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:44:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676693359] [2024-09-25 10:44:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:09,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:09,824 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:44:09,825 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:44:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:09,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:44:09,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 10:44:09,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:44:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:44:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676693359] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:44:10,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:44:10,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2024-09-25 10:44:10,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171253712] [2024-09-25 10:44:10,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:44:10,003 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:44:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:10,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:44:10,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:44:10,004 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2024-09-25 10:44:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:10,269 INFO L93 Difference]: Finished difference Result 254 states and 311 transitions. [2024-09-25 10:44:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 10:44:10,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 49 [2024-09-25 10:44:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:10,272 INFO L225 Difference]: With dead ends: 254 [2024-09-25 10:44:10,272 INFO L226 Difference]: Without dead ends: 247 [2024-09-25 10:44:10,272 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:44:10,272 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 109 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:10,272 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 148 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:44:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-09-25 10:44:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2024-09-25 10:44:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 155 states have internal predecessors, (175), 58 states have call successors, (58), 27 states have call predecessors, (58), 26 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-25 10:44:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2024-09-25 10:44:10,309 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 49 [2024-09-25 10:44:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:10,309 INFO L474 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2024-09-25 10:44:10,310 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2024-09-25 10:44:10,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2024-09-25 10:44:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 10:44:10,311 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:10,312 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1] [2024-09-25 10:44:10,325 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:44:10,516 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:44:10,517 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:10,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 260253794, now seen corresponding path program 1 times [2024-09-25 10:44:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675873414] [2024-09-25 10:44:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:44:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233220958] [2024-09-25 10:44:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:10,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:10,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:10,536 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:44:10,538 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:44:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:10,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-25 10:44:10,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:44:10,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:44:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:44:11,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675873414] [2024-09-25 10:44:11,001 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:44:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233220958] [2024-09-25 10:44:11,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233220958] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:44:11,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:44:11,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-09-25 10:44:11,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070948439] [2024-09-25 10:44:11,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:11,002 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:44:11,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:11,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:44:11,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:44:11,003 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 10:44:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:11,131 INFO L93 Difference]: Finished difference Result 249 states and 303 transitions. [2024-09-25 10:44:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:44:11,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2024-09-25 10:44:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:11,134 INFO L225 Difference]: With dead ends: 249 [2024-09-25 10:44:11,134 INFO L226 Difference]: Without dead ends: 243 [2024-09-25 10:44:11,134 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:44:11,134 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:11,135 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 113 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:44:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-09-25 10:44:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 178. [2024-09-25 10:44:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 114 states have (on average 1.131578947368421) internal successors, (129), 119 states have internal predecessors, (129), 39 states have call successors, (39), 25 states have call predecessors, (39), 24 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-09-25 10:44:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2024-09-25 10:44:11,178 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 54 [2024-09-25 10:44:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:11,178 INFO L474 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2024-09-25 10:44:11,179 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 10:44:11,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2024-09-25 10:44:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-25 10:44:11,180 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:11,180 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:11,192 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:44:11,384 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:44:11,385 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:11,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1070557628, now seen corresponding path program 1 times [2024-09-25 10:44:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:11,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966537127] [2024-09-25 10:44:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:44:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:44:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:44:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:44:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:44:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:44:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 10:44:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:44:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 10:44:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-25 10:44:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:44:11,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966537127] [2024-09-25 10:44:11,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966537127] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:44:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572880553] [2024-09-25 10:44:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:11,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:11,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:11,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:44:11,491 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:44:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:11,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:44:11,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:44:11,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:44:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:44:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572880553] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:44:11,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:44:11,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-09-25 10:44:11,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484656843] [2024-09-25 10:44:11,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:44:11,644 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:44:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:11,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:44:11,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:44:11,645 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 10:44:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:11,808 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2024-09-25 10:44:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:44:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 70 [2024-09-25 10:44:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:11,810 INFO L225 Difference]: With dead ends: 190 [2024-09-25 10:44:11,810 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:44:11,810 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:44:11,811 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:11,811 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 116 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:44:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:44:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:44:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 10:44:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:44:11,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-09-25 10:44:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:11,812 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:44:11,812 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 10:44:11,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:44:11,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:44:11,816 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:44:11,828 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:44:12,016 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:12,019 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:12,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:44:13,472 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:44:13,485 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:13,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:13,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:13,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:13,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:13,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:13,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:13,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:13,487 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~counter~0 0) (= |old(~counter~0)| 0)) Eliminated clause: (= ~counter~0 0) [2024-09-25 10:44:13,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:13,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:13,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:13,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:13,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:13,487 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:13,488 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:13,488 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:13,488 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:13,488 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:13,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:13,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:13,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:13,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:13,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:13,490 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:13,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:44:13 BoogieIcfgContainer [2024-09-25 10:44:13,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:44:13,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:44:13,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:44:13,492 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:44:13,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:44:06" (3/4) ... [2024-09-25 10:44:13,494 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:44:13,539 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:44:13,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:44:13,539 INFO L158 Benchmark]: Toolchain (without parser) took 7422.36ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 45.7MB in the beginning and 101.0MB in the end (delta: -55.2MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:13,540 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 28.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:44:13,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.06ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 53.2MB in the end (delta: -7.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-09-25 10:44:13,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 13.71ms. Allocated memory is still 75.5MB. Free memory was 53.2MB in the beginning and 52.2MB in the end (delta: 969.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:13,540 INFO L158 Benchmark]: Boogie Preprocessor took 28.66ms. Allocated memory is still 75.5MB. Free memory was 52.2MB in the beginning and 50.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:44:13,540 INFO L158 Benchmark]: RCFGBuilder took 258.28ms. Allocated memory is still 75.5MB. Free memory was 50.4MB in the beginning and 37.5MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 10:44:13,541 INFO L158 Benchmark]: TraceAbstraction took 6882.87ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 36.7MB in the beginning and 104.1MB in the end (delta: -67.4MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2024-09-25 10:44:13,541 INFO L158 Benchmark]: Witness Printer took 47.58ms. Allocated memory is still 134.2MB. Free memory was 104.1MB in the beginning and 101.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 10:44:13,542 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 28.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.06ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 53.2MB in the end (delta: -7.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 13.71ms. Allocated memory is still 75.5MB. Free memory was 53.2MB in the beginning and 52.2MB in the end (delta: 969.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.66ms. Allocated memory is still 75.5MB. Free memory was 52.2MB in the beginning and 50.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 258.28ms. Allocated memory is still 75.5MB. Free memory was 50.4MB in the beginning and 37.5MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6882.87ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 36.7MB in the beginning and 104.1MB in the end (delta: -67.4MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * Witness Printer took 47.58ms. Allocated memory is still 134.2MB. Free memory was 104.1MB in the beginning and 101.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 1280 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 949 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 968 IncrementalHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 331 mSDtfsCounter, 968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 510 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=9, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1741 SizeOfPredicates, 14 NumberOfNonLiveVariables, 817 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 905/967 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((1 <= r) && (((((__int128) q * y) + r) + ((__int128) a * y)) == ((__int128) b + x))) && (\old(counter) == 0)) && (1 <= y)) && (b == ((__int128) a * y))) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((__int128) q * y) + r) == x) && (((((__int128) q * y) + r) + ((__int128) a * y)) == ((__int128) b + x))) && (\old(counter) == 0)) && (1 <= y)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == \old(counter))) && (counter == 0)) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: ((cond != 0) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:44:13,563 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE