./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/heavy-2.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 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/heavy-2.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 26cfb5016cc2fdf76245f73dcfd6db92bad09f670b983fa3e94b365d8471a941 --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-6908dde-m [2024-09-24 22:58:13,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 22:58:13,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 22:58:13,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 22:58:13,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 22:58:13,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 22:58:13,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 22:58:13,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 22:58:13,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 22:58:13,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 22:58:13,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 22:58:13,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 22:58:13,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 22:58:13,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 22:58:13,774 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 22:58:13,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 22:58:13,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 22:58:13,775 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 22:58:13,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 22:58:13,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 22:58:13,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 22:58:13,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 22:58:13,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 22:58:13,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 22:58:13,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 22:58:13,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 22:58:13,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 22:58:13,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 22:58:13,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 22:58:13,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 22:58:13,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 22:58:13,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 22:58:13,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 22:58:13,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 22:58:13,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 22:58:13,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 22:58:13,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 22:58:13,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 22:58:13,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 22:58:13,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 22:58:13,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 22:58:13,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 22:58:13,783 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 -> 26cfb5016cc2fdf76245f73dcfd6db92bad09f670b983fa3e94b365d8471a941 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-24 22:58:14,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 22:58:14,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 22:58:14,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 22:58:14,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 22:58:14,096 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 22:58:14,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/heavy-2.c [2024-09-24 22:58:15,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 22:58:15,713 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 22:58:15,714 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/heavy-2.c [2024-09-24 22:58:15,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/629ba7786/1bc3adefba3c486ab28d5c9e70b50e21/FLAG45e0885e8 [2024-09-24 22:58:16,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/629ba7786/1bc3adefba3c486ab28d5c9e70b50e21 [2024-09-24 22:58:16,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 22:58:16,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 22:58:16,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 22:58:16,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 22:58:16,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 22:58:16,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a374a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16, skipping insertion in model container [2024-09-24 22:58:16,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 22:58:16,284 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/loops/heavy-2.c[600,613] [2024-09-24 22:58:16,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 22:58:16,327 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 22:58:16,343 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/loops/heavy-2.c[600,613] [2024-09-24 22:58:16,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 22:58:16,411 INFO L204 MainTranslator]: Completed translation [2024-09-24 22:58:16,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16 WrapperNode [2024-09-24 22:58:16,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 22:58:16,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 22:58:16,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 22:58:16,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 22:58:16,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,432 INFO L138 Inliner]: procedures = 12, calls = 13, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 22:58:16,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 22:58:16,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 22:58:16,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 22:58:16,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 22:58:16,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,459 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-09-24 22:58:16,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 22:58:16,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 22:58:16,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 22:58:16,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 22:58:16,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 22:58:16,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:16,510 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-24 22:58:16,512 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-24 22:58:16,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-24 22:58:16,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-24 22:58:16,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 22:58:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 22:58:16,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 22:58:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 22:58:16,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 22:58:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-24 22:58:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-24 22:58:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 22:58:16,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 22:58:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 22:58:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-24 22:58:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-09-24 22:58:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-09-24 22:58:16,630 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 22:58:16,632 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 22:58:16,810 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-24 22:58:16,810 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 22:58:16,841 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 22:58:16,842 INFO L317 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-24 22:58:16,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:58:16 BoogieIcfgContainer [2024-09-24 22:58:16,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 22:58:16,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 22:58:16,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 22:58:16,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 22:58:16,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 10:58:16" (1/3) ... [2024-09-24 22:58:16,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78db7562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:58:16, skipping insertion in model container [2024-09-24 22:58:16,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (2/3) ... [2024-09-24 22:58:16,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78db7562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:58:16, skipping insertion in model container [2024-09-24 22:58:16,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:58:16" (3/3) ... [2024-09-24 22:58:16,858 INFO L112 eAbstractionObserver]: Analyzing ICFG heavy-2.c [2024-09-24 22:58:16,873 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 22:58:16,874 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 22:58:16,937 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 22:58:16,943 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;@5180afbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 22:58:16,945 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 22:58:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 22:58:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-24 22:58:16,962 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:16,962 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:16,963 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:16,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash -12526131, now seen corresponding path program 1 times [2024-09-24 22:58:16,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:16,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744603054] [2024-09-24 22:58:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,176 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-24 22:58:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:17,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744603054] [2024-09-24 22:58:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744603054] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 22:58:17,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 22:58:17,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 22:58:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067031579] [2024-09-24 22:58:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 22:58:17,185 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 22:58:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:17,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 22:58:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 22:58:17,208 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:17,305 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2024-09-24 22:58:17,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 22:58:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-24 22:58:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:17,313 INFO L225 Difference]: With dead ends: 39 [2024-09-24 22:58:17,314 INFO L226 Difference]: Without dead ends: 21 [2024-09-24 22:58:17,316 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-24 22:58:17,319 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:17,321 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 22:58:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-24 22:58:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2024-09-24 22:58:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-09-24 22:58:17,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2024-09-24 22:58:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:17,352 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-09-24 22:58:17,353 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-09-24 22:58:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-24 22:58:17,355 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:17,355 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:17,356 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 22:58:17,357 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:17,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash -12554961, now seen corresponding path program 1 times [2024-09-24 22:58:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:17,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553514876] [2024-09-24 22:58:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,480 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-24 22:58:17,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:17,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553514876] [2024-09-24 22:58:17,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553514876] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 22:58:17,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 22:58:17,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 22:58:17,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752243781] [2024-09-24 22:58:17,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 22:58:17,483 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 22:58:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 22:58:17,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 22:58:17,486 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:17,587 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-09-24 22:58:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 22:58:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-24 22:58:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:17,588 INFO L225 Difference]: With dead ends: 33 [2024-09-24 22:58:17,588 INFO L226 Difference]: Without dead ends: 30 [2024-09-24 22:58:17,589 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 22:58:17,590 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:17,590 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 7 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 22:58:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-24 22:58:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 14. [2024-09-24 22:58:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-09-24 22:58:17,599 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2024-09-24 22:58:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:17,600 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-09-24 22:58:17,600 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-09-24 22:58:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-24 22:58:17,601 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:17,601 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:17,602 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 22:58:17,602 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:17,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash -329697748, now seen corresponding path program 1 times [2024-09-24 22:58:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:17,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532859922] [2024-09-24 22:58:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:17,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:17,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532859922] [2024-09-24 22:58:17,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532859922] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 22:58:17,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 22:58:17,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 22:58:17,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697402051] [2024-09-24 22:58:17,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 22:58:17,768 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 22:58:17,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:17,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 22:58:17,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 22:58:17,769 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:17,854 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2024-09-24 22:58:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 22:58:17,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-24 22:58:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:17,855 INFO L225 Difference]: With dead ends: 36 [2024-09-24 22:58:17,855 INFO L226 Difference]: Without dead ends: 28 [2024-09-24 22:58:17,856 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 22:58:17,857 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:17,857 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 22:58:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-24 22:58:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 15. [2024-09-24 22:58:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-09-24 22:58:17,865 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-09-24 22:58:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:17,866 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-09-24 22:58:17,866 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-09-24 22:58:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-24 22:58:17,867 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:17,867 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:17,867 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 22:58:17,867 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:17,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1642028949, now seen corresponding path program 1 times [2024-09-24 22:58:17,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:17,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803793859] [2024-09-24 22:58:17,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:17,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:18,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803793859] [2024-09-24 22:58:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803793859] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 22:58:18,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 22:58:18,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 22:58:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678770996] [2024-09-24 22:58:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 22:58:18,007 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 22:58:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 22:58:18,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 22:58:18,010 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:18,057 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-09-24 22:58:18,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 22:58:18,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-24 22:58:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:18,059 INFO L225 Difference]: With dead ends: 27 [2024-09-24 22:58:18,059 INFO L226 Difference]: Without dead ends: 18 [2024-09-24 22:58:18,059 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 22:58:18,061 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:18,061 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 20 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 22:58:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-24 22:58:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-09-24 22:58:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-24 22:58:18,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2024-09-24 22:58:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:18,066 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-24 22:58:18,066 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-24 22:58:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-24 22:58:18,067 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:18,067 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:18,067 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-24 22:58:18,068 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:18,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1568904865, now seen corresponding path program 1 times [2024-09-24 22:58:18,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260287757] [2024-09-24 22:58:18,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:18,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260287757] [2024-09-24 22:58:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260287757] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:58:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181000589] [2024-09-24 22:58:18,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:18,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:18,259 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-24 22:58:18,261 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-24 22:58:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:18,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 22:58:18,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:58:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:18,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:58:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:18,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181000589] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:58:18,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:58:18,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2024-09-24 22:58:18,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830608920] [2024-09-24 22:58:18,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:58:18,441 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 22:58:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 22:58:18,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-09-24 22:58:18,442 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:18,609 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-09-24 22:58:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 22:58:18,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-24 22:58:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:18,610 INFO L225 Difference]: With dead ends: 37 [2024-09-24 22:58:18,611 INFO L226 Difference]: Without dead ends: 27 [2024-09-24 22:58:18,612 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-09-24 22:58:18,616 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:18,616 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 22:58:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-24 22:58:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2024-09-24 22:58:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-09-24 22:58:18,625 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2024-09-24 22:58:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:18,625 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-09-24 22:58:18,625 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-09-24 22:58:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-24 22:58:18,629 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:18,630 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:18,649 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-24 22:58:18,834 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-24 22:58:18,835 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:18,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash -632848917, now seen corresponding path program 2 times [2024-09-24 22:58:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:18,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433762737] [2024-09-24 22:58:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:19,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433762737] [2024-09-24 22:58:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433762737] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:58:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634159129] [2024-09-24 22:58:19,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 22:58:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:19,060 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-24 22:58:19,061 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-24 22:58:19,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-24 22:58:19,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 22:58:19,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-24 22:58:19,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:58:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 22:58:19,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 22:58:19,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634159129] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 22:58:19,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 22:58:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-09-24 22:58:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884535726] [2024-09-24 22:58:19,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 22:58:19,155 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 22:58:19,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:19,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 22:58:19,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-24 22:58:19,156 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:19,167 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-09-24 22:58:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 22:58:19,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-24 22:58:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:19,168 INFO L225 Difference]: With dead ends: 19 [2024-09-24 22:58:19,168 INFO L226 Difference]: Without dead ends: 0 [2024-09-24 22:58:19,169 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-24 22:58:19,169 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:19,170 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 22:58:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-24 22:58:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-24 22:58:19,171 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-24 22:58:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-24 22:58:19,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-09-24 22:58:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:19,171 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-24 22:58:19,171 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:19,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-24 22:58:19,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-24 22:58:19,174 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-24 22:58:19,192 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-24 22:58:19,376 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-24 22:58:19,379 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-09-24 22:58:19,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-24 22:58:19,423 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 22:58:19,440 WARN L155 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (= |#memory_int#1| |old(#memory_int#1)|) Eliminated clause: true [2024-09-24 22:58:19,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 10:58:19 BoogieIcfgContainer [2024-09-24 22:58:19,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 22:58:19,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-24 22:58:19,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-24 22:58:19,444 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-24 22:58:19,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:58:16" (3/4) ... [2024-09-24 22:58:19,447 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-24 22:58:19,505 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-24 22:58:19,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-24 22:58:19,506 INFO L158 Benchmark]: Toolchain (without parser) took 3405.20ms. Allocated memory is still 169.9MB. Free memory was 140.0MB in the beginning and 62.6MB in the end (delta: 77.3MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2024-09-24 22:58:19,506 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 22:58:19,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.23ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 94.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-09-24 22:58:19,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.69ms. Allocated memory is still 169.9MB. Free memory was 94.9MB in the beginning and 93.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 22:58:19,508 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 169.9MB. Free memory was 93.6MB in the beginning and 91.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 22:58:19,508 INFO L158 Benchmark]: RCFGBuilder took 368.38ms. Allocated memory is still 169.9MB. Free memory was 91.7MB in the beginning and 135.0MB in the end (delta: -43.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-24 22:58:19,509 INFO L158 Benchmark]: TraceAbstraction took 2594.87ms. Allocated memory is still 169.9MB. Free memory was 135.0MB in the beginning and 65.8MB in the end (delta: 69.2MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2024-09-24 22:58:19,510 INFO L158 Benchmark]: Witness Printer took 61.90ms. Allocated memory is still 169.9MB. Free memory was 65.8MB in the beginning and 62.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 22:58:19,512 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.20ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.23ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 94.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.69ms. Allocated memory is still 169.9MB. Free memory was 94.9MB in the beginning and 93.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 169.9MB. Free memory was 93.6MB in the beginning and 91.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 368.38ms. Allocated memory is still 169.9MB. Free memory was 91.7MB in the beginning and 135.0MB in the end (delta: -43.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2594.87ms. Allocated memory is still 169.9MB. Free memory was 135.0MB in the beginning and 65.8MB in the end (delta: 69.2MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * Witness Printer took 61.90ms. Allocated memory is still 169.9MB. Free memory was 65.8MB in the beginning and 62.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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: 21]: 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 3 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 41 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 47 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 107 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 1 NumberOfNonLiveVariables, 147 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 23/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (a == 1) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (a == 1) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (a == 1) - InvariantResult [Line: 21]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2024-09-24 22:58:19,543 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