./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 27b49876 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.4-tmp.dk.referee-eval-27b4987-m [2024-09-21 12:25:14,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 12:25:14,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 12:25:14,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 12:25:14,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 12:25:14,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 12:25:14,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 12:25:14,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 12:25:14,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 12:25:14,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 12:25:14,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 12:25:14,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 12:25:14,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 12:25:14,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 12:25:14,515 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 12:25:14,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 12:25:14,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 12:25:14,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 12:25:14,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 12:25:14,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 12:25:14,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 12:25:14,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 12:25:14,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 12:25:14,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 12:25:14,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 12:25:14,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 12:25:14,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 12:25:14,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 12:25:14,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 12:25:14,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 12:25:14,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 12:25:14,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 12:25:14,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 12:25:14,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 12:25:14,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 12:25:14,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 12:25:14,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 12:25:14,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 12:25:14,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 12:25:14,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 12:25:14,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 12:25:14,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 12:25:14,521 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-09-21 12:25:14,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 12:25:14,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 12:25:14,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 12:25:14,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 12:25:14,771 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 12:25:14,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Primes.c [2024-09-21 12:25:15,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 12:25:16,131 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 12:25:16,131 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Primes.c [2024-09-21 12:25:16,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0901bc184/3ffbc7e37b834f30af3f5330eeebbee8/FLAGe2eee5348 [2024-09-21 12:25:16,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0901bc184/3ffbc7e37b834f30af3f5330eeebbee8 [2024-09-21 12:25:16,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 12:25:16,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 12:25:16,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 12:25:16,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 12:25:16,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 12:25:16,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b08b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16, skipping insertion in model container [2024-09-21 12:25:16,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 12:25:16,715 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-09-21 12:25:16,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 12:25:16,731 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 12:25:16,754 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-09-21 12:25:16,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 12:25:16,768 INFO L204 MainTranslator]: Completed translation [2024-09-21 12:25:16,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16 WrapperNode [2024-09-21 12:25:16,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 12:25:16,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 12:25:16,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 12:25:16,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 12:25:16,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,797 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 12:25:16,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 12:25:16,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 12:25:16,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 12:25:16,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 12:25:16,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-21 12:25:16,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 12:25:16,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 12:25:16,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 12:25:16,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 12:25:16,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (1/1) ... [2024-09-21 12:25:16,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 12:25:16,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:16,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-21 12:25:16,861 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-21 12:25:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2024-09-21 12:25:16,897 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2024-09-21 12:25:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 12:25:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-09-21 12:25:16,897 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-09-21 12:25:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2024-09-21 12:25:16,897 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2024-09-21 12:25:16,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 12:25:16,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 12:25:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 12:25:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime [2024-09-21 12:25:16,898 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime [2024-09-21 12:25:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 12:25:16,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 12:25:16,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 12:25:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 12:25:16,954 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 12:25:16,956 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 12:25:17,146 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-21 12:25:17,146 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 12:25:17,188 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 12:25:17,189 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-21 12:25:17,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:25:17 BoogieIcfgContainer [2024-09-21 12:25:17,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 12:25:17,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 12:25:17,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 12:25:17,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 12:25:17,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 12:25:16" (1/3) ... [2024-09-21 12:25:17,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9726d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:25:17, skipping insertion in model container [2024-09-21 12:25:17,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:25:16" (2/3) ... [2024-09-21 12:25:17,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9726d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:25:17, skipping insertion in model container [2024-09-21 12:25:17,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:25:17" (3/3) ... [2024-09-21 12:25:17,197 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2024-09-21 12:25:17,215 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 12:25:17,215 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 12:25:17,270 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 12:25:17,275 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27fcfc0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 12:25:17,276 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 12:25:17,279 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-09-21 12:25:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-21 12:25:17,285 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:17,285 INFO L216 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-09-21 12:25:17,286 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:17,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash 745641163, now seen corresponding path program 1 times [2024-09-21 12:25:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:17,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577966094] [2024-09-21 12:25:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:25:17,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:17,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577966094] [2024-09-21 12:25:17,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577966094] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:17,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 12:25:17,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659079188] [2024-09-21 12:25:17,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:17,473 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 12:25:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 12:25:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 12:25:17,497 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-09-21 12:25:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:17,548 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2024-09-21 12:25:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 12:25:17,551 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-09-21 12:25:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:17,557 INFO L225 Difference]: With dead ends: 66 [2024-09-21 12:25:17,557 INFO L226 Difference]: Without dead ends: 55 [2024-09-21 12:25:17,560 INFO L433 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-09-21 12:25:17,562 INFO L434 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-09-21 12:25:17,563 INFO L435 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-09-21 12:25:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-21 12:25:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-21 12:25:17,596 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-09-21 12:25:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-09-21 12:25:17,599 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 21 [2024-09-21 12:25:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:17,601 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-09-21 12:25:17,601 INFO L475 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-09-21 12:25:17,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-09-21 12:25:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-21 12:25:17,603 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:17,603 INFO L216 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-09-21 12:25:17,603 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 12:25:17,604 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:17,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1491686554, now seen corresponding path program 1 times [2024-09-21 12:25:17,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593748485] [2024-09-21 12:25:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,765 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-21 12:25:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:25:17,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:17,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593748485] [2024-09-21 12:25:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593748485] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:17,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:17,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-21 12:25:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511775255] [2024-09-21 12:25:17,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:17,906 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-21 12:25:17,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-21 12:25:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-21 12:25:17,907 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-09-21 12:25:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:17,959 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-09-21 12:25:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-21 12:25:17,965 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-09-21 12:25:17,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:17,968 INFO L225 Difference]: With dead ends: 78 [2024-09-21 12:25:17,969 INFO L226 Difference]: Without dead ends: 57 [2024-09-21 12:25:17,971 INFO L433 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-09-21 12:25:17,972 INFO L434 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.0s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:17,974 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 468 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 12:25:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-21 12:25:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-21 12:25:17,983 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-09-21 12:25:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-09-21 12:25:17,985 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 28 [2024-09-21 12:25:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:17,985 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-09-21 12:25:17,985 INFO L475 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-09-21 12:25:17,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-09-21 12:25:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-21 12:25:17,987 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:17,987 INFO L216 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-09-21 12:25:17,987 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 12:25:17,988 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:17,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1689656639, now seen corresponding path program 1 times [2024-09-21 12:25:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333909637] [2024-09-21 12:25:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-21 12:25:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:25:18,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333909637] [2024-09-21 12:25:18,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333909637] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:18,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:18,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 12:25:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109713675] [2024-09-21 12:25:18,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:18,123 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 12:25:18,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 12:25:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:25:18,124 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-09-21 12:25:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:18,177 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-09-21 12:25:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:25:18,177 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-09-21 12:25:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:18,178 INFO L225 Difference]: With dead ends: 63 [2024-09-21 12:25:18,179 INFO L226 Difference]: Without dead ends: 59 [2024-09-21 12:25:18,179 INFO L433 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-09-21 12:25:18,180 INFO L434 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-09-21 12:25:18,180 INFO L435 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-09-21 12:25:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-21 12:25:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-21 12:25:18,186 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-09-21 12:25:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-09-21 12:25:18,187 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 29 [2024-09-21 12:25:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:18,187 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-09-21 12:25:18,188 INFO L475 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-09-21 12:25:18,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-09-21 12:25:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-21 12:25:18,189 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:18,189 INFO L216 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-09-21 12:25:18,189 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-21 12:25:18,189 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:18,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash -145981177, now seen corresponding path program 1 times [2024-09-21 12:25:18,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:18,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543990639] [2024-09-21 12:25:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-21 12:25:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:25:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543990639] [2024-09-21 12:25:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543990639] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-21 12:25:18,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055504814] [2024-09-21 12:25:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:18,278 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 12:25:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:18,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 12:25:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-21 12:25:18,279 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-09-21 12:25:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:18,364 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-09-21 12:25:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:25:18,365 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-09-21 12:25:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:18,366 INFO L225 Difference]: With dead ends: 67 [2024-09-21 12:25:18,366 INFO L226 Difference]: Without dead ends: 63 [2024-09-21 12:25:18,367 INFO L433 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-09-21 12:25:18,368 INFO L434 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-09-21 12:25:18,368 INFO L435 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-09-21 12:25:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-21 12:25:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-09-21 12:25:18,376 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-09-21 12:25:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-09-21 12:25:18,377 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2024-09-21 12:25:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:18,377 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-09-21 12:25:18,378 INFO L475 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-09-21 12:25:18,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-09-21 12:25:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-21 12:25:18,379 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:18,379 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:18,379 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-21 12:25:18,380 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:18,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1109477137, now seen corresponding path program 1 times [2024-09-21 12:25:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:18,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633624466] [2024-09-21 12:25:18,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-21 12:25:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:25:18,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:18,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633624466] [2024-09-21 12:25:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633624466] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:25:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898629523] [2024-09-21 12:25:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:18,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:18,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:18,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:25:18,509 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-21 12:25:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:18,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-21 12:25:18,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:25:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-21 12:25:18,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:25:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:25:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898629523] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:25:18,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:25:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-09-21 12:25:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4005515] [2024-09-21 12:25:18,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:25:18,856 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-21 12:25:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-21 12:25:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-21 12:25:18,857 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-09-21 12:25:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:18,986 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-09-21 12:25:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-21 12:25:18,987 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-09-21 12:25:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:18,989 INFO L225 Difference]: With dead ends: 76 [2024-09-21 12:25:18,992 INFO L226 Difference]: Without dead ends: 57 [2024-09-21 12:25:18,992 INFO L433 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-09-21 12:25:18,993 INFO L434 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-09-21 12:25:18,993 INFO L435 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-09-21 12:25:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-21 12:25:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-21 12:25:19,005 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-09-21 12:25:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2024-09-21 12:25:19,006 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 37 [2024-09-21 12:25:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:19,007 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2024-09-21 12:25:19,007 INFO L475 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-09-21 12:25:19,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-09-21 12:25:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-21 12:25:19,012 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:19,012 INFO L216 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-09-21 12:25:19,029 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-21 12:25:19,213 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:19,213 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:19,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash -466412443, now seen corresponding path program 1 times [2024-09-21 12:25:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975370304] [2024-09-21 12:25:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-21 12:25:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:25:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975370304] [2024-09-21 12:25:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975370304] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:25:19,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137191204] [2024-09-21 12:25:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:19,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:19,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:19,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:25:19,489 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-21 12:25:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:19,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-21 12:25:19,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:25:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:25:19,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:25:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:25:19,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137191204] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:25:19,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:25:19,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-09-21 12:25:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232474730] [2024-09-21 12:25:19,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:25:19,964 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-21 12:25:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-21 12:25:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2024-09-21 12:25:19,965 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-09-21 12:25:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:20,227 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2024-09-21 12:25:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-21 12:25:20,228 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-09-21 12:25:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:20,229 INFO L225 Difference]: With dead ends: 79 [2024-09-21 12:25:20,229 INFO L226 Difference]: Without dead ends: 60 [2024-09-21 12:25:20,230 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2024-09-21 12:25:20,235 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-09-21 12:25:20,235 INFO L435 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-09-21 12:25:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-21 12:25:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-09-21 12:25:20,244 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-09-21 12:25:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-21 12:25:20,245 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2024-09-21 12:25:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:20,245 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-21 12:25:20,246 INFO L475 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-09-21 12:25:20,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-21 12:25:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-21 12:25:20,247 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:20,247 INFO L216 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-09-21 12:25:20,260 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-21 12:25:20,451 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-21 12:25:20,452 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:20,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1285413673, now seen corresponding path program 1 times [2024-09-21 12:25:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:20,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229758592] [2024-09-21 12:25:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-21 12:25:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-21 12:25:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:20,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229758592] [2024-09-21 12:25:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229758592] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:20,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-21 12:25:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100146063] [2024-09-21 12:25:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:20,569 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-21 12:25:20,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:20,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-21 12:25:20,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-21 12:25:20,569 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-09-21 12:25:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:20,610 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-09-21 12:25:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:25:20,610 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-09-21 12:25:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:20,612 INFO L225 Difference]: With dead ends: 80 [2024-09-21 12:25:20,612 INFO L226 Difference]: Without dead ends: 59 [2024-09-21 12:25:20,612 INFO L433 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-09-21 12:25:20,613 INFO L434 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-09-21 12:25:20,614 INFO L435 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-09-21 12:25:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-21 12:25:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-21 12:25:20,621 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-09-21 12:25:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-21 12:25:20,622 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 40 [2024-09-21 12:25:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:20,622 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-21 12:25:20,622 INFO L475 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-09-21 12:25:20,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-21 12:25:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-21 12:25:20,626 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:20,627 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:20,627 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-21 12:25:20,627 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:20,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2101385548, now seen corresponding path program 1 times [2024-09-21 12:25:20,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:20,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393621513] [2024-09-21 12:25:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:20,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-21 12:25:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-21 12:25:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-21 12:25:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393621513] [2024-09-21 12:25:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393621513] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-21 12:25:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607454464] [2024-09-21 12:25:20,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:20,697 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 12:25:20,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 12:25:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-21 12:25:20,698 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-09-21 12:25:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:20,742 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2024-09-21 12:25:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:25:20,742 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-09-21 12:25:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:20,743 INFO L225 Difference]: With dead ends: 113 [2024-09-21 12:25:20,743 INFO L226 Difference]: Without dead ends: 57 [2024-09-21 12:25:20,743 INFO L433 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-09-21 12:25:20,744 INFO L434 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-09-21 12:25:20,744 INFO L435 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-09-21 12:25:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-21 12:25:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-09-21 12:25:20,749 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-09-21 12:25:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-09-21 12:25:20,750 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 58 [2024-09-21 12:25:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:20,750 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-09-21 12:25:20,750 INFO L475 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-09-21 12:25:20,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-09-21 12:25:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-21 12:25:20,751 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:20,751 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:20,751 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-21 12:25:20,751 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:20,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1599878374, now seen corresponding path program 1 times [2024-09-21 12:25:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846434101] [2024-09-21 12:25:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-21 12:25:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-21 12:25:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-21 12:25:20,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:20,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846434101] [2024-09-21 12:25:20,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846434101] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:25:20,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364170411] [2024-09-21 12:25:20,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:20,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:20,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:25:20,825 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-21 12:25:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:20,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-21 12:25:20,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:25:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-21 12:25:20,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 12:25:20,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364170411] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:20,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-21 12:25:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-09-21 12:25:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119770070] [2024-09-21 12:25:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:20,900 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 12:25:20,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 12:25:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-21 12:25:20,900 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-09-21 12:25:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:20,948 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-09-21 12:25:20,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:25:20,948 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-09-21 12:25:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:20,949 INFO L225 Difference]: With dead ends: 105 [2024-09-21 12:25:20,949 INFO L226 Difference]: Without dead ends: 59 [2024-09-21 12:25:20,950 INFO L433 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-09-21 12:25:20,950 INFO L434 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-09-21 12:25:20,950 INFO L435 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-09-21 12:25:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-21 12:25:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-21 12:25:20,964 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-09-21 12:25:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-09-21 12:25:20,964 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 59 [2024-09-21 12:25:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:20,965 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-09-21 12:25:20,965 INFO L475 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-09-21 12:25:20,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-09-21 12:25:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-21 12:25:20,966 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:20,966 INFO L216 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-09-21 12:25:20,981 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-21 12:25:21,166 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-21 12:25:21,167 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:21,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -904213436, now seen corresponding path program 1 times [2024-09-21 12:25:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:21,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956324070] [2024-09-21 12:25:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-21 12:25:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-21 12:25:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-21 12:25:21,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956324070] [2024-09-21 12:25:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956324070] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:25:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995759925] [2024-09-21 12:25:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:21,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:21,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:25:21,400 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-21 12:25:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:21,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-21 12:25:21,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:25:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-21 12:25:21,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:25:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-21 12:25:21,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995759925] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:25:21,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:25:21,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-09-21 12:25:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013722831] [2024-09-21 12:25:21,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:25:21,893 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-21 12:25:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:21,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-21 12:25:21,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-21 12:25:21,897 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-09-21 12:25:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:22,128 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2024-09-21 12:25:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-21 12:25:22,129 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-09-21 12:25:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:22,130 INFO L225 Difference]: With dead ends: 99 [2024-09-21 12:25:22,130 INFO L226 Difference]: Without dead ends: 67 [2024-09-21 12:25:22,131 INFO L433 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-09-21 12:25:22,131 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:22,131 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 498 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-21 12:25:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-21 12:25:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-09-21 12:25:22,142 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-09-21 12:25:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-09-21 12:25:22,143 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 68 [2024-09-21 12:25:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:22,143 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-09-21 12:25:22,143 INFO L475 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-09-21 12:25:22,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-09-21 12:25:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-21 12:25:22,144 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:22,144 INFO L216 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-09-21 12:25:22,158 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-21 12:25:22,348 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:22,349 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:22,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash -640732844, now seen corresponding path program 2 times [2024-09-21 12:25:22,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846946445] [2024-09-21 12:25:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-21 12:25:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-21 12:25:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-21 12:25:22,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:22,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846946445] [2024-09-21 12:25:22,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846946445] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:25:22,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855551194] [2024-09-21 12:25:22,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-21 12:25:22,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:22,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:22,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:25:22,644 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-21 12:25:22,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-21 12:25:22,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 12:25:22,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-21 12:25:22,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:25:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-21 12:25:22,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:25:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-21 12:25:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855551194] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:25:23,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:25:23,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2024-09-21 12:25:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886270021] [2024-09-21 12:25:23,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:25:23,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-21 12:25:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-21 12:25:23,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-09-21 12:25:23,480 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-09-21 12:25:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:23,839 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2024-09-21 12:25:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-21 12:25:23,839 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-09-21 12:25:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:23,840 INFO L225 Difference]: With dead ends: 157 [2024-09-21 12:25:23,840 INFO L226 Difference]: Without dead ends: 101 [2024-09-21 12:25:23,841 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2024-09-21 12:25:23,841 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 78 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-21 12:25:23,842 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 508 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-21 12:25:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-21 12:25:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-09-21 12:25:23,852 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-09-21 12:25:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2024-09-21 12:25:23,852 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 77 [2024-09-21 12:25:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:23,853 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2024-09-21 12:25:23,853 INFO L475 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-09-21 12:25:23,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2024-09-21 12:25:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-21 12:25:23,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:23,854 INFO L216 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-09-21 12:25:23,867 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-21 12:25:24,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-21 12:25:24,058 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:24,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1768804806, now seen corresponding path program 1 times [2024-09-21 12:25:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:24,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749578646] [2024-09-21 12:25:24,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-21 12:25:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-21 12:25:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-21 12:25:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-21 12:25:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749578646] [2024-09-21 12:25:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749578646] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:25:24,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:25:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-21 12:25:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335150259] [2024-09-21 12:25:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:25:24,197 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 12:25:24,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 12:25:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-21 12:25:24,198 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-09-21 12:25:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:24,236 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2024-09-21 12:25:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-21 12:25:24,237 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-09-21 12:25:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:24,238 INFO L225 Difference]: With dead ends: 185 [2024-09-21 12:25:24,239 INFO L226 Difference]: Without dead ends: 97 [2024-09-21 12:25:24,239 INFO L433 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-09-21 12:25:24,240 INFO L434 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-09-21 12:25:24,240 INFO L435 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-09-21 12:25:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-21 12:25:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-09-21 12:25:24,275 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-09-21 12:25:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2024-09-21 12:25:24,277 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 84 [2024-09-21 12:25:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:24,277 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2024-09-21 12:25:24,277 INFO L475 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-09-21 12:25:24,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2024-09-21 12:25:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-21 12:25:24,280 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:25:24,280 INFO L216 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-09-21 12:25:24,281 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-21 12:25:24,281 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:25:24,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -802082800, now seen corresponding path program 2 times [2024-09-21 12:25:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:25:24,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639342909] [2024-09-21 12:25:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:25:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:25:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:25:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,348 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 12:25:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-21 12:25:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-21 12:25:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:25:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-21 12:25:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-21 12:25:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-21 12:25:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:25:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-21 12:25:24,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:25:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639342909] [2024-09-21 12:25:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639342909] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:25:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534494536] [2024-09-21 12:25:24,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-21 12:25:24,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:25:24,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:25:24,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:25:24,607 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-21 12:25:24,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-21 12:25:24,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 12:25:24,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-21 12:25:24,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:25:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-21 12:25:24,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:25:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-21 12:25:26,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534494536] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:25:26,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:25:26,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 25 [2024-09-21 12:25:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761418077] [2024-09-21 12:25:26,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:25:26,394 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-21 12:25:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:25:26,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-21 12:25:26,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-09-21 12:25:26,395 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-09-21 12:25:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:25:26,628 INFO L93 Difference]: Finished difference Result 158 states and 212 transitions. [2024-09-21 12:25:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-21 12:25:26,628 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-09-21 12:25:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:25:26,629 INFO L225 Difference]: With dead ends: 158 [2024-09-21 12:25:26,629 INFO L226 Difference]: Without dead ends: 0 [2024-09-21 12:25:26,630 INFO L433 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-09-21 12:25:26,630 INFO L434 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-09-21 12:25:26,630 INFO L435 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-09-21 12:25:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-21 12:25:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-21 12:25:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-21 12:25:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-21 12:25:26,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-09-21 12:25:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:25:26,635 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-21 12:25:26,635 INFO L475 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-09-21 12:25:26,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:25:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-21 12:25:26,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-21 12:25:26,637 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-21 12:25:26,650 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-21 12:25:26,838 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-21 12:25:26,841 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:25:26,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-21 12:25:28,092 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-21 12:25:28,112 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-21 12:25:28,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 12:25:28 BoogieIcfgContainer [2024-09-21 12:25:28,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-21 12:25:28,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-21 12:25:28,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-21 12:25:28,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-21 12:25:28,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:25:17" (3/4) ... [2024-09-21 12:25:28,117 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-21 12:25:28,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-21 12:25:28,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-21 12:25:28,164 INFO L158 Benchmark]: Toolchain (without parser) took 11622.02ms. Allocated memory was 163.6MB in the beginning and 293.6MB in the end (delta: 130.0MB). Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2024-09-21 12:25:28,164 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 12:25:28,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.63ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 115.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-21 12:25:28,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.54ms. Allocated memory is still 163.6MB. Free memory was 115.5MB in the beginning and 114.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 12:25:28,165 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 163.6MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 12:25:28,165 INFO L158 Benchmark]: RCFGBuilder took 356.03ms. Allocated memory is still 163.6MB. Free memory was 112.4MB in the beginning and 132.2MB in the end (delta: -19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-21 12:25:28,165 INFO L158 Benchmark]: TraceAbstraction took 10922.96ms. Allocated memory was 163.6MB in the beginning and 293.6MB in the end (delta: 130.0MB). Free memory was 131.2MB in the beginning and 127.1MB in the end (delta: 4.1MB). Peak memory consumption was 171.2MB. Max. memory is 16.1GB. [2024-09-21 12:25:28,166 INFO L158 Benchmark]: Witness Printer took 48.90ms. Allocated memory is still 293.6MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 12:25:28,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.63ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 115.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.54ms. Allocated memory is still 163.6MB. Free memory was 115.5MB in the beginning and 114.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 163.6MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.03ms. Allocated memory is still 163.6MB. Free memory was 112.4MB in the beginning and 132.2MB in the end (delta: -19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10922.96ms. Allocated memory was 163.6MB in the beginning and 293.6MB in the end (delta: 130.0MB). Free memory was 131.2MB in the beginning and 127.1MB in the end (delta: 4.1MB). Peak memory consumption was 171.2MB. Max. memory is 16.1GB. * Witness Printer took 48.90ms. Allocated memory is still 293.6MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 9.6s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 4316 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3584 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1750 IncrementalHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 732 mSDtfsCounter, 1750 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.2s 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.8s 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-09-21 12:25:28,192 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE