./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Primes.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 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:09:13,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:09:13,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:09:13,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:09:13,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:09:13,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:09:13,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:09:13,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:09:13,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:09:13,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:09:13,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:09:13,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:09:13,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:09:13,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:09:13,728 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:09:13,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:09:13,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:09:13,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:09:13,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:09:13,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:09:13,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:09:13,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:09:13,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:09:13,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:09:13,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:09:13,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:09:13,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:09:13,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:09:13,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:09:13,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:09:13,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:09:13,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:09:13,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:09:13,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:09:13,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:09:13,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:09:13,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:09:13,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:09:13,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:09:13,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:09:13,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:09:13,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:09:13,742 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:09:14,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:09:14,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:09:14,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:09:14,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:09:14,067 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:09:14,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Primes.c [2024-10-15 15:09:15,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:09:15,627 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:09:15,628 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Primes.c [2024-10-15 15:09:15,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fbac1cae0/2bbd4d877bd84cceadb13d09ab17cbfb/FLAG2c0891850 [2024-10-15 15:09:15,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fbac1cae0/2bbd4d877bd84cceadb13d09ab17cbfb [2024-10-15 15:09:15,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:09:15,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:09:15,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:09:15,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:09:15,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:09:15,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3627a30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15, skipping insertion in model container [2024-10-15 15:09:15,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:09:15,863 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/recursive/Primes.c[2190,2203] [2024-10-15 15:09:15,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:09:15,875 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:09:15,892 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/recursive/Primes.c[2190,2203] [2024-10-15 15:09:15,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:09:15,912 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:09:15,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15 WrapperNode [2024-10-15 15:09:15,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:09:15,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:09:15,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:09:15,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:09:15,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,932 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:09:15,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:09:15,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:09:15,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:09:15,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:09:15,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,955 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-10-15 15:09:15,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:09:15,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:09:15,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:09:15,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:09:15,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (1/1) ... [2024-10-15 15:09:15,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:09:15,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:09:16,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 15:09:16,009 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 15:09:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2024-10-15 15:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2024-10-15 15:09:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:09:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-10-15 15:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-10-15 15:09:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2024-10-15 15:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2024-10-15 15:09:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:09:16,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:09:16,049 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime [2024-10-15 15:09:16,049 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime [2024-10-15 15:09:16,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:09:16,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:09:16,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:09:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:09:16,112 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:09:16,115 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:09:16,368 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-15 15:09:16,368 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:09:16,393 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:09:16,393 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:09:16,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:09:16 BoogieIcfgContainer [2024-10-15 15:09:16,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:09:16,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:09:16,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:09:16,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:09:16,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:09:15" (1/3) ... [2024-10-15 15:09:16,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193d43ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:09:16, skipping insertion in model container [2024-10-15 15:09:16,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:09:15" (2/3) ... [2024-10-15 15:09:16,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193d43ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:09:16, skipping insertion in model container [2024-10-15 15:09:16,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:09:16" (3/3) ... [2024-10-15 15:09:16,406 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2024-10-15 15:09:16,421 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:09:16,422 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:09:16,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:09:16,493 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f25f304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:09:16,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:09:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 15:09:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 15:09:16,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:16,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:16,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:16,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash 745641163, now seen corresponding path program 1 times [2024-10-15 15:09:16,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818773229] [2024-10-15 15:09:16,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:16,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:09:16,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:16,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818773229] [2024-10-15 15:09:16,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818773229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:09:16,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:09:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 15:09:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568941806] [2024-10-15 15:09:16,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:09:16,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 15:09:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:16,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 15:09:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 15:09:16,812 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 15:09:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:16,864 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2024-10-15 15:09:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 15:09:16,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-10-15 15:09:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:16,875 INFO L225 Difference]: With dead ends: 66 [2024-10-15 15:09:16,875 INFO L226 Difference]: Without dead ends: 55 [2024-10-15 15:09:16,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-15 15:09:16,883 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:16,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:09:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-15 15:09:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-15 15:09:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-15 15:09:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-10-15 15:09:16,932 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 21 [2024-10-15 15:09:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:16,934 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-10-15 15:09:16,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 15:09:16,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-10-15 15:09:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-15 15:09:16,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:16,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:16,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:09:16,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:16,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1491686554, now seen corresponding path program 1 times [2024-10-15 15:09:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:16,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734615192] [2024-10-15 15:09:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-15 15:09:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:09:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734615192] [2024-10-15 15:09:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734615192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:09:17,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:09:17,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 15:09:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056510491] [2024-10-15 15:09:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:09:17,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 15:09:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:17,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 15:09:17,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-15 15:09:17,288 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:09:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:17,372 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-10-15 15:09:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 15:09:17,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-15 15:09:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:17,379 INFO L225 Difference]: With dead ends: 78 [2024-10-15 15:09:17,379 INFO L226 Difference]: Without dead ends: 57 [2024-10-15 15:09:17,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-15 15:09:17,382 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:17,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 468 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:09:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-15 15:09:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-15 15:09:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-10-15 15:09:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-10-15 15:09:17,402 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 28 [2024-10-15 15:09:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:17,402 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-10-15 15:09:17,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:09:17,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-10-15 15:09:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-15 15:09:17,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:17,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 15:09:17,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:17,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1689656639, now seen corresponding path program 1 times [2024-10-15 15:09:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:17,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212057537] [2024-10-15 15:09:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 15:09:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:09:17,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:17,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212057537] [2024-10-15 15:09:17,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212057537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:09:17,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:09:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 15:09:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316805843] [2024-10-15 15:09:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:09:17,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 15:09:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 15:09:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:09:17,605 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:09:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:17,662 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-10-15 15:09:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:09:17,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-10-15 15:09:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:17,668 INFO L225 Difference]: With dead ends: 63 [2024-10-15 15:09:17,668 INFO L226 Difference]: Without dead ends: 59 [2024-10-15 15:09:17,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:09:17,671 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:17,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 265 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:09:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-15 15:09:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-15 15:09:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 41 states have internal predecessors, (51), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-15 15:09:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-10-15 15:09:17,691 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 29 [2024-10-15 15:09:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:17,692 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-10-15 15:09:17,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 15:09:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-10-15 15:09:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-15 15:09:17,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:17,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:17,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 15:09:17,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:17,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash -145981177, now seen corresponding path program 1 times [2024-10-15 15:09:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:17,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439789733] [2024-10-15 15:09:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 15:09:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:09:17,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:17,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439789733] [2024-10-15 15:09:17,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439789733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:09:17,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:09:17,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 15:09:17,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999468765] [2024-10-15 15:09:17,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:09:17,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:09:17,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:09:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 15:09:17,820 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-15 15:09:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:17,912 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-10-15 15:09:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:09:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-10-15 15:09:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:17,915 INFO L225 Difference]: With dead ends: 67 [2024-10-15 15:09:17,915 INFO L226 Difference]: Without dead ends: 63 [2024-10-15 15:09:17,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:09:17,916 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:17,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 230 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:09:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-15 15:09:17,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-10-15 15:09:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 41 states have internal predecessors, (51), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-15 15:09:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-10-15 15:09:17,927 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2024-10-15 15:09:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:17,928 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-10-15 15:09:17,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-15 15:09:17,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-10-15 15:09:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-15 15:09:17,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:17,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 15:09:17,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1109477137, now seen corresponding path program 1 times [2024-10-15 15:09:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925147220] [2024-10-15 15:09:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:17,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 15:09:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:09:18,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:18,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925147220] [2024-10-15 15:09:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925147220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:09:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714927250] [2024-10-15 15:09:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:18,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:09:18,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:09:18,072 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:09:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:18,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 15:09:18,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:09:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-15 15:09:18,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:09:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:09:18,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714927250] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:09:18,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:09:18,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-10-15 15:09:18,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847977795] [2024-10-15 15:09:18,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:09:18,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-15 15:09:18,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:18,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 15:09:18,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-15 15:09:18,472 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-15 15:09:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:18,634 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-10-15 15:09:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 15:09:18,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 37 [2024-10-15 15:09:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:18,636 INFO L225 Difference]: With dead ends: 76 [2024-10-15 15:09:18,636 INFO L226 Difference]: Without dead ends: 57 [2024-10-15 15:09:18,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-10-15 15:09:18,637 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:18,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 458 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:09:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-15 15:09:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-15 15:09:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-15 15:09:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2024-10-15 15:09:18,658 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 37 [2024-10-15 15:09:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:18,658 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2024-10-15 15:09:18,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-15 15:09:18,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-10-15 15:09:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-15 15:09:18,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:18,660 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-10-15 15:09:18,676 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:09:18,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:18,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:18,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash -466412443, now seen corresponding path program 1 times [2024-10-15 15:09:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872054018] [2024-10-15 15:09:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:19,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:19,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 15:09:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:09:19,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:19,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872054018] [2024-10-15 15:09:19,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872054018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:09:19,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767498756] [2024-10-15 15:09:19,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:19,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:09:19,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:09:19,146 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:09:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:19,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-15 15:09:19,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:09:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:09:19,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:09:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:09:19,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767498756] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:09:19,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:09:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-10-15 15:09:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033632917] [2024-10-15 15:09:19,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:09:19,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-15 15:09:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 15:09:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2024-10-15 15:09:19,806 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-15 15:09:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:20,139 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2024-10-15 15:09:20,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-15 15:09:20,140 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 38 [2024-10-15 15:09:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:20,142 INFO L225 Difference]: With dead ends: 79 [2024-10-15 15:09:20,142 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 15:09:20,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2024-10-15 15:09:20,143 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:20,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 738 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:09:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 15:09:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-10-15 15:09:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-15 15:09:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-10-15 15:09:20,156 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2024-10-15 15:09:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:20,157 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-10-15 15:09:20,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-15 15:09:20,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-10-15 15:09:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-15 15:09:20,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:20,161 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:20,181 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 15:09:20,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 15:09:20,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:20,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1285413673, now seen corresponding path program 1 times [2024-10-15 15:09:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429823867] [2024-10-15 15:09:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 15:09:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:09:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429823867] [2024-10-15 15:09:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429823867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:09:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:09:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 15:09:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180810953] [2024-10-15 15:09:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:09:20,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 15:09:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:20,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 15:09:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-15 15:09:20,522 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 15:09:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:20,563 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-10-15 15:09:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:09:20,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-10-15 15:09:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:20,565 INFO L225 Difference]: With dead ends: 80 [2024-10-15 15:09:20,565 INFO L226 Difference]: Without dead ends: 59 [2024-10-15 15:09:20,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-15 15:09:20,566 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:20,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:09:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-15 15:09:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-10-15 15:09:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-15 15:09:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-10-15 15:09:20,574 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 40 [2024-10-15 15:09:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:20,575 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-10-15 15:09:20,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 15:09:20,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-10-15 15:09:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-15 15:09:20,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:20,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:20,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 15:09:20,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:20,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2101385548, now seen corresponding path program 1 times [2024-10-15 15:09:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:20,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134670935] [2024-10-15 15:09:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-15 15:09:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 15:09:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-15 15:09:20,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:20,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134670935] [2024-10-15 15:09:20,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134670935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:09:20,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:09:20,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 15:09:20,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93965110] [2024-10-15 15:09:20,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:09:20,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:09:20,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:20,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:09:20,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 15:09:20,654 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 15:09:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:20,712 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2024-10-15 15:09:20,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:09:20,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-15 15:09:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:20,713 INFO L225 Difference]: With dead ends: 113 [2024-10-15 15:09:20,713 INFO L226 Difference]: Without dead ends: 57 [2024-10-15 15:09:20,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:09:20,715 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:20,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 197 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:09:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-15 15:09:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-10-15 15:09:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-10-15 15:09:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-10-15 15:09:20,723 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 58 [2024-10-15 15:09:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:20,724 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-10-15 15:09:20,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 15:09:20,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-10-15 15:09:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-15 15:09:20,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:20,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:20,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-15 15:09:20,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:20,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:20,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1599878374, now seen corresponding path program 1 times [2024-10-15 15:09:20,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:20,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071938807] [2024-10-15 15:09:20,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:20,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 15:09:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 15:09:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 15:09:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071938807] [2024-10-15 15:09:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071938807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:09:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895960904] [2024-10-15 15:09:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:20,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:20,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:09:20,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:09:20,846 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:09:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:20,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 15:09:20,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:09:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 15:09:20,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:09:20,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895960904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:09:20,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 15:09:20,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-15 15:09:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611513964] [2024-10-15 15:09:20,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:09:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:09:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:09:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 15:09:20,937 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 15:09:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:20,994 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-10-15 15:09:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:09:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-15 15:09:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:20,996 INFO L225 Difference]: With dead ends: 105 [2024-10-15 15:09:20,996 INFO L226 Difference]: Without dead ends: 59 [2024-10-15 15:09:20,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 15:09:20,997 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 13 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:20,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 175 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:09:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-15 15:09:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-10-15 15:09:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-15 15:09:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-10-15 15:09:21,012 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 59 [2024-10-15 15:09:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:21,012 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-10-15 15:09:21,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 15:09:21,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-10-15 15:09:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-15 15:09:21,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:21,014 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:21,034 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 15:09:21,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-15 15:09:21,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:21,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -904213436, now seen corresponding path program 1 times [2024-10-15 15:09:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:21,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26732758] [2024-10-15 15:09:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 15:09:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 15:09:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 15:09:21,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:21,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26732758] [2024-10-15 15:09:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26732758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:09:21,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917345618] [2024-10-15 15:09:21,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:21,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:21,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:09:21,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:09:21,531 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 15:09:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:21,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 15:09:21,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:09:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 15:09:21,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:09:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 15:09:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917345618] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:09:22,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:09:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-10-15 15:09:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453758643] [2024-10-15 15:09:22,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:09:22,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 15:09:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 15:09:22,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-15 15:09:22,177 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 10 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-15 15:09:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:22,487 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2024-10-15 15:09:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 15:09:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 10 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 10 states have call successors, (16) Word has length 68 [2024-10-15 15:09:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:22,489 INFO L225 Difference]: With dead ends: 99 [2024-10-15 15:09:22,489 INFO L226 Difference]: Without dead ends: 67 [2024-10-15 15:09:22,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2024-10-15 15:09:22,490 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:22,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 498 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:09:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-15 15:09:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-10-15 15:09:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 10 states have call successors, (10), 6 states have call predecessors, (10), 9 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-15 15:09:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-10-15 15:09:22,501 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 68 [2024-10-15 15:09:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:22,502 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-10-15 15:09:22,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 10 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-15 15:09:22,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-10-15 15:09:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-15 15:09:22,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:22,503 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:22,520 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 15:09:22,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:22,704 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:22,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash -640732844, now seen corresponding path program 2 times [2024-10-15 15:09:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654608625] [2024-10-15 15:09:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:22,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:22,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:22,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 15:09:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 15:09:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 15:09:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654608625] [2024-10-15 15:09:23,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654608625] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:09:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903337699] [2024-10-15 15:09:23,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:09:23,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:23,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:09:23,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:09:23,084 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 15:09:23,144 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:09:23,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:09:23,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 15:09:23,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:09:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 15:09:23,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:09:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 15:09:24,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903337699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:09:24,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:09:24,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2024-10-15 15:09:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352137051] [2024-10-15 15:09:24,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:09:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-15 15:09:24,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-15 15:09:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-10-15 15:09:24,189 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 22 states, 19 states have (on average 5.0) internal successors, (95), 22 states have internal predecessors, (95), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 12 states have call successors, (20) [2024-10-15 15:09:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:24,651 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2024-10-15 15:09:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 15:09:24,652 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.0) internal successors, (95), 22 states have internal predecessors, (95), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 12 states have call successors, (20) Word has length 77 [2024-10-15 15:09:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:24,654 INFO L225 Difference]: With dead ends: 157 [2024-10-15 15:09:24,654 INFO L226 Difference]: Without dead ends: 101 [2024-10-15 15:09:24,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2024-10-15 15:09:24,655 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 78 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:24,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 508 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 15:09:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-15 15:09:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-10-15 15:09:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 72 states have internal predecessors, (75), 14 states have call successors, (14), 10 states have call predecessors, (14), 14 states have return successors, (34), 14 states have call predecessors, (34), 13 states have call successors, (34) [2024-10-15 15:09:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2024-10-15 15:09:24,680 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 77 [2024-10-15 15:09:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:24,681 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2024-10-15 15:09:24,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.0) internal successors, (95), 22 states have internal predecessors, (95), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 12 states have call successors, (20) [2024-10-15 15:09:24,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2024-10-15 15:09:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-15 15:09:24,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:24,684 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:24,700 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 15:09:24,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-15 15:09:24,885 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:24,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1768804806, now seen corresponding path program 1 times [2024-10-15 15:09:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:24,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086925452] [2024-10-15 15:09:24,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:24,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:24,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:24,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:09:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 15:09:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-15 15:09:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-15 15:09:25,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:25,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086925452] [2024-10-15 15:09:25,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086925452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:09:25,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:09:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 15:09:25,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070030840] [2024-10-15 15:09:25,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:09:25,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:09:25,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:25,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:09:25,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 15:09:25,031 INFO L87 Difference]: Start difference. First operand 97 states and 123 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-15 15:09:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:25,079 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2024-10-15 15:09:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 15:09:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 84 [2024-10-15 15:09:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:25,082 INFO L225 Difference]: With dead ends: 185 [2024-10-15 15:09:25,082 INFO L226 Difference]: Without dead ends: 97 [2024-10-15 15:09:25,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:09:25,083 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:25,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 186 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:09:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-15 15:09:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-15 15:09:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 72 states have internal predecessors, (75), 14 states have call successors, (14), 10 states have call predecessors, (14), 14 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2024-10-15 15:09:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2024-10-15 15:09:25,102 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 84 [2024-10-15 15:09:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:25,103 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2024-10-15 15:09:25,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-15 15:09:25,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2024-10-15 15:09:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-15 15:09:25,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:25,106 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:25,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-15 15:09:25,106 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash -802082800, now seen corresponding path program 2 times [2024-10-15 15:09:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361311030] [2024-10-15 15:09:25,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:09:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 15:09:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-15 15:09:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-15 15:09:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:09:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-15 15:09:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 15:09:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-15 15:09:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:09:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-15 15:09:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:09:25,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361311030] [2024-10-15 15:09:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361311030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:09:25,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322936071] [2024-10-15 15:09:25,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:09:25,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:25,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:09:25,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:09:25,531 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 15:09:25,603 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:09:25,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:09:25,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 15:09:25,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:09:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-15 15:09:25,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:09:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-15 15:09:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322936071] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:09:27,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:09:27,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 25 [2024-10-15 15:09:27,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146520560] [2024-10-15 15:09:27,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:09:27,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-15 15:09:27,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:09:27,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 15:09:27,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-10-15 15:09:27,848 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 25 states have internal predecessors, (125), 15 states have call successors, (25), 2 states have call predecessors, (25), 8 states have return successors, (25), 7 states have call predecessors, (25), 15 states have call successors, (25) [2024-10-15 15:09:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:28,074 INFO L93 Difference]: Finished difference Result 158 states and 212 transitions. [2024-10-15 15:09:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 15:09:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 25 states have internal predecessors, (125), 15 states have call successors, (25), 2 states have call predecessors, (25), 8 states have return successors, (25), 7 states have call predecessors, (25), 15 states have call successors, (25) Word has length 93 [2024-10-15 15:09:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:28,075 INFO L225 Difference]: With dead ends: 158 [2024-10-15 15:09:28,075 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:09:28,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 190 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2024-10-15 15:09:28,077 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:28,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 243 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:09:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:09:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:09:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 15:09:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:09:28,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-10-15 15:09:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:28,078 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:09:28,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 25 states have internal predecessors, (125), 15 states have call successors, (25), 2 states have call predecessors, (25), 8 states have return successors, (25), 7 states have call predecessors, (25), 15 states have call successors, (25) [2024-10-15 15:09:28,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:09:28,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:09:28,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:09:28,099 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-15 15:09:28,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-15 15:09:28,285 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:09:28,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:09:29,959 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 15:09:29,982 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-15 15:09:29,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:09:29 BoogieIcfgContainer [2024-10-15 15:09:29,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 15:09:29,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 15:09:29,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 15:09:29,986 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 15:09:29,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:09:16" (3/4) ... [2024-10-15 15:09:29,988 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 15:09:30,043 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 15:09:30,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 15:09:30,045 INFO L158 Benchmark]: Toolchain (without parser) took 14393.16ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 118.3MB in the beginning and 203.9MB in the end (delta: -85.6MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2024-10-15 15:09:30,045 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 148.9MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:09:30,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.71ms. Allocated memory is still 148.9MB. Free memory was 118.3MB in the beginning and 105.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:09:30,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.38ms. Allocated memory is still 148.9MB. Free memory was 105.0MB in the beginning and 104.3MB in the end (delta: 685.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:09:30,046 INFO L158 Benchmark]: Boogie Preprocessor took 42.34ms. Allocated memory is still 148.9MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:09:30,046 INFO L158 Benchmark]: RCFGBuilder took 417.67ms. Allocated memory is still 148.9MB. Free memory was 102.2MB in the beginning and 112.2MB in the end (delta: -10.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:09:30,046 INFO L158 Benchmark]: TraceAbstraction took 13586.08ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 111.4MB in the beginning and 206.0MB in the end (delta: -94.5MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. [2024-10-15 15:09:30,047 INFO L158 Benchmark]: Witness Printer took 59.33ms. Allocated memory is still 314.6MB. Free memory was 206.0MB in the beginning and 203.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:09:30,048 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.29ms. Allocated memory is still 148.9MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.71ms. Allocated memory is still 148.9MB. Free memory was 118.3MB in the beginning and 105.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.38ms. Allocated memory is still 148.9MB. Free memory was 105.0MB in the beginning and 104.3MB in the end (delta: 685.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.34ms. Allocated memory is still 148.9MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 417.67ms. Allocated memory is still 148.9MB. Free memory was 102.2MB in the beginning and 112.2MB in the end (delta: -10.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13586.08ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 111.4MB in the beginning and 206.0MB in the end (delta: -94.5MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. * Witness Printer took 59.33ms. Allocated memory is still 314.6MB. Free memory was 206.0MB in the beginning and 203.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 98]: 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 7 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 4316 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3584 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1777 IncrementalHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 732 mSDtfsCounter, 1777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 805 SyntacticMatches, 19 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, InterpolantAutomatonStates: 114, 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, 13 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 3220 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 287/540 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 - ProcedureContractResult [Line: 31]: Procedure Contract for multiple_of Derived contract for procedure multiple_of. Ensures: (((((((long long) m * 2) < ((long long) n + 1)) || (n == m)) || (n == 0)) || (((long long) n + m) < 1)) || (m < 1)) - ProcedureContractResult [Line: 17]: Procedure Contract for mult Derived contract for procedure mult. Ensures: ((((2 < \result) || (\result == 0)) || (m < 2)) || (n < 2)) - ProcedureContractResult [Line: 52]: Procedure Contract for is_prime Derived contract for procedure is_prime. Ensures: ((n < 3) || (\result == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-15 15:09:30,081 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE