./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7a9d89991bb39658ba66b50d9cb80ba7d1aa37f87b1a2f7972fc25c15a1ea38 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:44:11,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:44:11,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:44:11,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:44:11,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:44:11,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:44:11,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:44:11,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:44:11,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:44:11,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:44:11,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:44:11,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:44:11,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:44:11,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:44:11,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:44:11,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:44:11,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:44:11,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:44:11,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:44:11,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:44:11,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:44:11,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:44:11,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:44:11,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:44:11,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:44:11,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:44:11,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:44:11,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:44:11,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:44:11,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:44:11,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:44:11,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:44:11,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:44:11,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:44:11,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:44:11,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:44:11,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:44:11,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:44:11,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:44:11,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:44:11,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:44:11,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:44:11,106 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 -> c7a9d89991bb39658ba66b50d9cb80ba7d1aa37f87b1a2f7972fc25c15a1ea38 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:44:11,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:44:11,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:44:11,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:44:11,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:44:11,326 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:44:11,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i [2024-10-15 14:44:12,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:44:12,666 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:44:12,670 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i [2024-10-15 14:44:12,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f153f2271/0694d03d5083487ab3c47d346cd3f9ce/FLAGb24fcd3a7 [2024-10-15 14:44:12,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f153f2271/0694d03d5083487ab3c47d346cd3f9ce [2024-10-15 14:44:12,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:44:12,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:44:12,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:44:12,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:44:12,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:44:12,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ccf9792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12, skipping insertion in model container [2024-10-15 14:44:12,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:44:12,862 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i[950,963] [2024-10-15 14:44:12,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:44:12,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:44:12,899 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound50.i[950,963] [2024-10-15 14:44:12,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:44:12,922 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:44:12,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12 WrapperNode [2024-10-15 14:44:12,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:44:12,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:44:12,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:44:12,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:44:12,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,939 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:44:12,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:44:12,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:44:12,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:44:12,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:44:12,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,959 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:44:12,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:44:12,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:44:12,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:44:12,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:44:12,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (1/1) ... [2024-10-15 14:44:12,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:44:12,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:44:12,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 14:44:12,996 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 14:44:13,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:44:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:44:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:44:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:44:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:44:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:44:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:44:13,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:44:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:44:13,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:44:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:44:13,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:44:13,078 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:44:13,079 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:44:13,201 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:44:13,201 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:44:13,218 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:44:13,219 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:44:13,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:44:13 BoogieIcfgContainer [2024-10-15 14:44:13,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:44:13,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:44:13,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:44:13,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:44:13,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:44:12" (1/3) ... [2024-10-15 14:44:13,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2d09e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:44:13, skipping insertion in model container [2024-10-15 14:44:13,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:44:12" (2/3) ... [2024-10-15 14:44:13,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2d09e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:44:13, skipping insertion in model container [2024-10-15 14:44:13,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:44:13" (3/3) ... [2024-10-15 14:44:13,225 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound50.i [2024-10-15 14:44:13,237 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:44:13,237 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:44:13,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:44:13,279 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c940bc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:44:13,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:44:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 14:44:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-15 14:44:13,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:44:13,288 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:44:13,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:44:13,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:44:13,292 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-10-15 14:44:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:44:13,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150408417] [2024-10-15 14:44:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:44:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:44:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:44:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:44:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:44:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:13,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:44:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:44:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:44:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:44:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150408417] [2024-10-15 14:44:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150408417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:44:13,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:44:13,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:44:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211685667] [2024-10-15 14:44:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:44:13,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:44:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:44:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:44:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:44:13,448 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:44:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:44:13,474 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-10-15 14:44:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:44:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-15 14:44:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:44:13,480 INFO L225 Difference]: With dead ends: 58 [2024-10-15 14:44:13,480 INFO L226 Difference]: Without dead ends: 28 [2024-10-15 14:44:13,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:44:13,485 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:44:13,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:44:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-15 14:44:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-15 14:44:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-15 14:44:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-15 14:44:13,519 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-10-15 14:44:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:44:13,520 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-15 14:44:13,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:44:13,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:44:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-15 14:44:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-15 14:44:13,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:44:13,525 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:44:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:44:13,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:44:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:44:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-10-15 14:44:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:44:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864629413] [2024-10-15 14:44:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:44:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:44:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:44:13,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106563378] [2024-10-15 14:44:13,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:44:13,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:44:13,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:44:13,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:44:13,601 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:44:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:13,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 14:44:13,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:44:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 14:44:13,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:44:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:44:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:44:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864629413] [2024-10-15 14:44:13,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:44:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106563378] [2024-10-15 14:44:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106563378] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:44:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:44:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-10-15 14:44:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353631171] [2024-10-15 14:44:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:44:13,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:44:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:44:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:44:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:44:13,979 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-15 14:44:18,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-10-15 14:44:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:44:18,051 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-15 14:44:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:44:18,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-10-15 14:44:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:44:18,052 INFO L225 Difference]: With dead ends: 38 [2024-10-15 14:44:18,052 INFO L226 Difference]: Without dead ends: 35 [2024-10-15 14:44:18,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:44:18,054 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:44:18,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2024-10-15 14:44:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-15 14:44:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-15 14:44:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 14:44:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-15 14:44:18,069 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 34 [2024-10-15 14:44:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:44:18,071 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-15 14:44:18,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-15 14:44:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:44:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-15 14:44:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-15 14:44:18,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:44:18,073 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:44:18,086 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:44:18,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:44:18,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:44:18,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:44:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-10-15 14:44:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:44:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647652297] [2024-10-15 14:44:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:44:18,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:44:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:44:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:44:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:44:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:18,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:44:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:44:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-15 14:44:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:44:18,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:44:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647652297] [2024-10-15 14:44:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647652297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:44:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:44:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 14:44:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773370020] [2024-10-15 14:44:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:44:18,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:44:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:44:18,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:44:18,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:44:18,749 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:44:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:44:18,779 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-10-15 14:44:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:44:18,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-10-15 14:44:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:44:18,780 INFO L225 Difference]: With dead ends: 51 [2024-10-15 14:44:18,781 INFO L226 Difference]: Without dead ends: 37 [2024-10-15 14:44:18,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:44:18,782 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:44:18,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:44:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-15 14:44:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-15 14:44:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-15 14:44:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-15 14:44:18,789 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2024-10-15 14:44:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:44:18,790 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-15 14:44:18,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:44:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:44:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-15 14:44:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-15 14:44:18,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:44:18,791 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:44:18,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:44:18,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:44:18,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:44:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-10-15 14:44:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:44:18,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661712249] [2024-10-15 14:44:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:44:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:44:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:44:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782218552] [2024-10-15 14:44:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:44:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:44:18,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:44:18,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:44:18,823 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:44:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:44:18,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 14:44:18,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:44:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-15 14:44:19,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:45:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:45:01,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661712249] [2024-10-15 14:45:01,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:45:01,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782218552] [2024-10-15 14:45:01,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782218552] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:45:01,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:45:01,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-10-15 14:45:01,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331784014] [2024-10-15 14:45:01,480 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-15 14:45:01,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-15 14:45:01,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:45:01,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 14:45:01,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=190, Unknown=9, NotChecked=0, Total=240 [2024-10-15 14:45:01,481 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 14:45:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:45:01,795 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-10-15 14:45:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 14:45:01,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-10-15 14:45:01,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:45:01,796 INFO L225 Difference]: With dead ends: 52 [2024-10-15 14:45:01,796 INFO L226 Difference]: Without dead ends: 48 [2024-10-15 14:45:01,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=47, Invalid=216, Unknown=9, NotChecked=0, Total=272 [2024-10-15 14:45:01,797 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:45:01,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 159 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:45:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-15 14:45:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-15 14:45:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 14:45:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-15 14:45:01,820 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 44 [2024-10-15 14:45:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:45:01,821 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-15 14:45:01,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 14:45:01,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:45:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-15 14:45:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-15 14:45:01,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:45:01,824 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:45:01,835 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:45:02,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:45:02,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:45:02,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:45:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-10-15 14:45:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:45:02,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521592402] [2024-10-15 14:45:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:45:02,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:45:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:45:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:45:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:45:02,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:45:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:45:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:45:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:45:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:45:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:45:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:45:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:45:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-15 14:45:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:45:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:45:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:45:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-15 14:45:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:45:02,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521592402] [2024-10-15 14:45:02,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521592402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:45:02,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095514032] [2024-10-15 14:45:02,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:45:02,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:45:02,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:45:02,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:45:02,504 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:45:02,588 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:45:02,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:45:02,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-15 14:45:02,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:45:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-15 14:45:03,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:45:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-15 14:45:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095514032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:45:03,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:45:03,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2024-10-15 14:45:03,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504309934] [2024-10-15 14:45:03,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:45:03,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-15 14:45:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:45:03,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-15 14:45:03,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:45:03,950 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-15 14:45:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:45:04,822 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-10-15 14:45:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:45:04,822 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) Word has length 52 [2024-10-15 14:45:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:45:04,824 INFO L225 Difference]: With dead ends: 86 [2024-10-15 14:45:04,824 INFO L226 Difference]: Without dead ends: 54 [2024-10-15 14:45:04,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-10-15 14:45:04,825 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:45:04,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 201 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:45:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-15 14:45:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-10-15 14:45:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 14:45:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-10-15 14:45:04,834 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2024-10-15 14:45:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:45:04,834 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-15 14:45:04,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-15 14:45:04,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:45:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-10-15 14:45:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:45:04,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:45:04,836 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:45:04,841 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:45:05,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:45:05,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:45:05,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:45:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash -860568069, now seen corresponding path program 3 times [2024-10-15 14:45:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:45:05,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227435264] [2024-10-15 14:45:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:45:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:45:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:45:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146195519] [2024-10-15 14:45:05,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:45:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:45:05,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:45:05,131 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:45:05,132 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:45:05,519 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-15 14:45:05,519 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:45:05,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-15 14:45:05,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:45:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-15 14:45:06,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:45:38,835 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:45:54,887 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:46:10,935 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:46:35,101 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:46:39,108 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 1073741824))) (let ((.cse3 (mod c_main_~A~0 4294967296)) (.cse2 (mod c_main_~r~0 4294967296)) (.cse0 (* .cse1 2))) (or (= .cse0 (mod c_main_~B~0 4294967296)) (< (* .cse1 4) (+ 1 .cse2)) (< .cse2 (mod c_main_~b~0 4294967296)) (not (= (mod (+ (* c_main_~b~0 c_main_~q~0 4) c_main_~r~0) 4294967296) .cse3)) (= .cse3 (mod (+ (* .cse1 c_main_~q~0 4) c_main_~r~0) 4294967296)) (< .cse2 .cse0)))) is different from true [2024-10-15 14:46:55,150 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:47:11,232 WARN L286 SmtUtils]: Spent 16.08s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:47:27,276 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:47:51,923 WARN L286 SmtUtils]: Spent 16.57s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:47:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 4 not checked. [2024-10-15 14:47:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:47:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227435264] [2024-10-15 14:47:51,964 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:47:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146195519] [2024-10-15 14:47:51,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146195519] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:47:51,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:47:51,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 27 [2024-10-15 14:47:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081616923] [2024-10-15 14:47:51,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:47:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-15 14:47:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:47:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-15 14:47:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=537, Unknown=1, NotChecked=48, Total=702 [2024-10-15 14:47:51,966 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-15 14:47:56,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []