./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.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 d7b32f819b918e072cd2f6b8ef11cf08c33c51198307cb8de75af009db97bd7b --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:44:47,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:44:47,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:44:47,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:44:47,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:44:47,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:44:47,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:44:47,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:44:47,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:44:47,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:44:47,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:44:47,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:44:47,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:44:47,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:44:47,818 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:44:47,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:44:47,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:44:47,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:44:47,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:44:47,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:44:47,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:44:47,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:44:47,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:44:47,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:44:47,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:44:47,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:44:47,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:44:47,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:44:47,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:44:47,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:44:47,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:44:47,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:44:47,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:44:47,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:44:47,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:44:47,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:44:47,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:44:47,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:44:47,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:44:47,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:44:47,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:44:47,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:44:47,825 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 -> d7b32f819b918e072cd2f6b8ef11cf08c33c51198307cb8de75af009db97bd7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:44:48,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:44:48,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:44:48,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:44:48,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:44:48,096 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:44:48,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i [2024-09-25 10:44:49,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:44:49,556 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:44:49,557 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i [2024-09-25 10:44:49,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d0b28fbee/0947791cce8a4c278948af190ea5fff7/FLAG650c08b53 [2024-09-25 10:44:49,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d0b28fbee/0947791cce8a4c278948af190ea5fff7 [2024-09-25 10:44:49,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:44:49,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:44:49,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:44:49,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:44:49,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:44:49,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf94788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49, skipping insertion in model container [2024-09-25 10:44:49,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:44:49,714 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/divbin2_unwindbound10.i[951,964] [2024-09-25 10:44:49,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:44:49,740 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:44:49,769 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/divbin2_unwindbound10.i[951,964] [2024-09-25 10:44:49,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:44:49,789 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:44:49,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49 WrapperNode [2024-09-25 10:44:49,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:44:49,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:44:49,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:44:49,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:44:49,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,808 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:44:49,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:44:49,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:44:49,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:44:49,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:44:49,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,828 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:44:49,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:44:49,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:44:49,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:44:49,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:44:49,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (1/1) ... [2024-09-25 10:44:49,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:44:49,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:49,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:44:49,871 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:44:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:44:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:44:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:44:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:44:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:44:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:44:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:44:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:44:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:44:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:44:49,957 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:44:49,959 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:44:50,097 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:44:50,098 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:44:50,116 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:44:50,116 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:44:50,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:44:50 BoogieIcfgContainer [2024-09-25 10:44:50,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:44:50,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:44:50,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:44:50,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:44:50,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:44:49" (1/3) ... [2024-09-25 10:44:50,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571e5061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:44:50, skipping insertion in model container [2024-09-25 10:44:50,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:44:49" (2/3) ... [2024-09-25 10:44:50,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571e5061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:44:50, skipping insertion in model container [2024-09-25 10:44:50,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:44:50" (3/3) ... [2024-09-25 10:44:50,122 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound10.i [2024-09-25 10:44:50,134 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:44:50,134 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:44:50,175 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:44:50,180 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;@14d80531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:44:50,180 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:44:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:44:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:44:50,187 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:50,188 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:50,188 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:50,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1996614108, now seen corresponding path program 1 times [2024-09-25 10:44:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99045480] [2024-09-25 10:44:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:50,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:50,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:50,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99045480] [2024-09-25 10:44:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99045480] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:50,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:50,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:44:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696623751] [2024-09-25 10:44:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:50,336 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:44:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:44:50,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:44:50,355 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-25 10:44:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:50,402 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2024-09-25 10:44:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:44:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2024-09-25 10:44:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:50,412 INFO L225 Difference]: With dead ends: 41 [2024-09-25 10:44:50,412 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 10:44:50,414 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-25 10:44:50,418 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:50,419 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:44:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 10:44:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-09-25 10:44:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:44:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-09-25 10:44:50,450 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2024-09-25 10:44:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:50,451 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-09-25 10:44:50,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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-25 10:44:50,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-09-25 10:44:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 10:44:50,453 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:50,453 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:50,453 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:44:50,454 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:50,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1251497910, now seen corresponding path program 1 times [2024-09-25 10:44:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:50,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070140388] [2024-09-25 10:44:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:50,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:50,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070140388] [2024-09-25 10:44:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070140388] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:50,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:50,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:44:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491807571] [2024-09-25 10:44:50,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:50,624 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:44:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:44:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:44:50,626 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 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-25 10:44:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:50,685 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-09-25 10:44:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:44:50,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 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 13 [2024-09-25 10:44:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:50,687 INFO L225 Difference]: With dead ends: 34 [2024-09-25 10:44:50,687 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:44:50,687 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:44:50,689 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:50,689 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:44:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:44:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:44:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:44:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-09-25 10:44:50,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2024-09-25 10:44:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:50,698 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-09-25 10:44:50,698 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 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-25 10:44:50,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-09-25 10:44:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:44:50,700 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:50,700 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:50,701 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:44:50,701 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:50,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:50,702 INFO L85 PathProgramCache]: Analyzing trace with hash -239317110, now seen corresponding path program 1 times [2024-09-25 10:44:50,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:50,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696043482] [2024-09-25 10:44:50,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:44:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026353484] [2024-09-25 10:44:50,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:50,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:50,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:44:50,731 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:44:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:50,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:44:50,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:50,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:44:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696043482] [2024-09-25 10:44:50,924 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:44:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026353484] [2024-09-25 10:44:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026353484] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:44:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009249979] [2024-09-25 10:44:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:50,925 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:44:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:44:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:44:50,926 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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-25 10:44:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:50,963 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-09-25 10:44:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:44:50,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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 14 [2024-09-25 10:44:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:50,964 INFO L225 Difference]: With dead ends: 34 [2024-09-25 10:44:50,964 INFO L226 Difference]: Without dead ends: 31 [2024-09-25 10:44:50,964 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:44:50,965 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:50,965 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:44:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-25 10:44:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-25 10:44:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:44:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-09-25 10:44:50,974 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 14 [2024-09-25 10:44:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:50,975 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-09-25 10:44:50,975 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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-25 10:44:50,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-09-25 10:44:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 10:44:50,980 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:50,980 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:50,996 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:44:51,180 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:51,181 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:51,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash 726925940, now seen corresponding path program 1 times [2024-09-25 10:44:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:51,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342816020] [2024-09-25 10:44:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:51,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:51,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:44:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342816020] [2024-09-25 10:44:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342816020] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:44:51,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:44:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:44:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273408492] [2024-09-25 10:44:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:44:51,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:44:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:44:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:44:51,389 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:44:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:51,427 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2024-09-25 10:44:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:44:51,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-09-25 10:44:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:51,428 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:44:51,428 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 10:44:51,428 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-25 10:44:51,429 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:51,429 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:44:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 10:44:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 10:44:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:44:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-09-25 10:44:51,450 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 23 [2024-09-25 10:44:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:51,451 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-09-25 10:44:51,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:44:51,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-09-25 10:44:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:44:51,453 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:51,453 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:51,453 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:44:51,453 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:51,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1153424271, now seen corresponding path program 1 times [2024-09-25 10:44:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722002928] [2024-09-25 10:44:51,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:51,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:51,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 10:44:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:44:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722002928] [2024-09-25 10:44:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722002928] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:44:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496062623] [2024-09-25 10:44:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:51,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:51,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:44:51,546 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:44:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:51,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:44:51,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:44:51,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:44:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:44:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496062623] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:44:51,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:44:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-25 10:44:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977633432] [2024-09-25 10:44:51,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:44:51,654 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:44:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:44:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:44:51,657 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:44:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:51,750 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2024-09-25 10:44:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:44:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2024-09-25 10:44:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:51,751 INFO L225 Difference]: With dead ends: 72 [2024-09-25 10:44:51,751 INFO L226 Difference]: Without dead ends: 51 [2024-09-25 10:44:51,752 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:44:51,753 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:51,753 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:44:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-25 10:44:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2024-09-25 10:44:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:44:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-25 10:44:51,761 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 25 [2024-09-25 10:44:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:51,762 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-25 10:44:51,762 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:44:51,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-25 10:44:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 10:44:51,762 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:44:51,762 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:51,779 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:44:51,963 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:51,964 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:44:51,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1935504499, now seen corresponding path program 1 times [2024-09-25 10:44:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:44:51,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629261625] [2024-09-25 10:44:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:51,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:44:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:44:51,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110558911] [2024-09-25 10:44:51,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:51,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:51,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:51,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:44:51,993 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:44:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:52,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 10:44:52,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:44:52,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:45:03,034 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:45:23,090 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:45:27,115 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse1 (mod c_main_~b~0 2147483648))) (or (= .cse0 (mod (+ c_main_~r~0 (* c_main_~q~0 2 .cse1)) 4294967296)) (not (= .cse0 (mod (+ (* c_main_~b~0 c_main_~q~0 2) c_main_~r~0) 4294967296))) (< (* 2 .cse1) (+ 1 (mod c_main_~r~0 4294967296))))) is different from true [2024-09-25 10:45:51,214 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:46:15,285 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:46:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-09-25 10:46:15,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:46:15,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629261625] [2024-09-25 10:46:15,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:46:15,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110558911] [2024-09-25 10:46:15,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110558911] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:46:15,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:46:15,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2024-09-25 10:46:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063270805] [2024-09-25 10:46:15,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:46:15,295 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:46:15,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:46:15,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:46:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=186, Unknown=1, NotChecked=28, Total=272 [2024-09-25 10:46:15,296 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:46:19,428 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 [] [2024-09-25 10:46:23,444 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 [] [2024-09-25 10:46:27,845 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 [] [2024-09-25 10:46:31,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:46:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:46:33,849 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2024-09-25 10:46:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 10:46:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-09-25 10:46:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:46:33,852 INFO L225 Difference]: With dead ends: 85 [2024-09-25 10:46:33,852 INFO L226 Difference]: Without dead ends: 80 [2024-09-25 10:46:33,853 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=74, Invalid=235, Unknown=1, NotChecked=32, Total=342 [2024-09-25 10:46:33,853 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:46:33,854 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 239 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 4 Unknown, 81 Unchecked, 18.3s Time] [2024-09-25 10:46:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-25 10:46:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-09-25 10:46:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 64 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 10:46:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2024-09-25 10:46:33,877 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 26 [2024-09-25 10:46:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:46:33,877 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-09-25 10:46:33,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:46:33,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:46:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2024-09-25 10:46:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 10:46:33,879 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:46:33,879 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:46:33,889 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 10:46:34,080 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:46:34,081 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:46:34,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:46:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1306939949, now seen corresponding path program 2 times [2024-09-25 10:46:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:46:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044865065] [2024-09-25 10:46:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:46:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:46:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:46:34,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72636787] [2024-09-25 10:46:34,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:46:34,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:46:34,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:46:34,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:46:34,136 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:46:34,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:46:34,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:46:34,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-25 10:46:34,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:46:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:46:34,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:46:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:46:46,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044865065] [2024-09-25 10:46:46,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:46:46,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72636787] [2024-09-25 10:46:46,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72636787] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:46:46,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:46:46,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-09-25 10:46:46,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149014383] [2024-09-25 10:46:46,951 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 10:46:46,951 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:46:46,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:46:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:46:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=182, Unknown=3, NotChecked=0, Total=240 [2024-09-25 10:46:46,952 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:46:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:46:47,152 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. [2024-09-25 10:46:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:46:47,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-09-25 10:46:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:46:47,154 INFO L225 Difference]: With dead ends: 123 [2024-09-25 10:46:47,154 INFO L226 Difference]: Without dead ends: 120 [2024-09-25 10:46:47,154 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=61, Invalid=208, Unknown=3, NotChecked=0, Total=272 [2024-09-25 10:46:47,155 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:46:47,155 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 218 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:46:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-25 10:46:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2024-09-25 10:46:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.197674418604651) internal successors, (103), 91 states have internal predecessors, (103), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-25 10:46:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2024-09-25 10:46:47,184 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 32 [2024-09-25 10:46:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:46:47,184 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2024-09-25 10:46:47,184 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:46:47,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:46:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2024-09-25 10:46:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-25 10:46:47,192 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:46:47,192 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:46:47,204 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:46:47,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:46:47,393 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:46:47,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:46:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2037540399, now seen corresponding path program 3 times [2024-09-25 10:46:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:46:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790344972] [2024-09-25 10:46:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:46:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:46:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:46:47,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:46:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:46:47,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:46:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:46:47,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 10:46:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:46:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:46:47,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:46:47,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790344972] [2024-09-25 10:46:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790344972] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:46:47,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250208776] [2024-09-25 10:46:47,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:46:47,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:46:47,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:46:47,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:46:47,904 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:48:47,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:48:47,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:48:47,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:48:47,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:48:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:48:47,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:48:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:48:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250208776] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:48:48,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:48:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-09-25 10:48:48,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971325856] [2024-09-25 10:48:48,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:48:48,150 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 10:48:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:48:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 10:48:48,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:48:48,151 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 10:48:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:48:48,290 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2024-09-25 10:48:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:48:48,290 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 35 [2024-09-25 10:48:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:48:48,292 INFO L225 Difference]: With dead ends: 137 [2024-09-25 10:48:48,292 INFO L226 Difference]: Without dead ends: 69 [2024-09-25 10:48:48,293 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:48:48,293 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:48:48,293 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:48:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-25 10:48:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2024-09-25 10:48:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.183673469387755) internal successors, (58), 52 states have internal predecessors, (58), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 10:48:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2024-09-25 10:48:48,312 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 35 [2024-09-25 10:48:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:48:48,312 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-09-25 10:48:48,312 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 10:48:48,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:48:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2024-09-25 10:48:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:48:48,316 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:48:48,316 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:48:48,338 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 10:48:48,517 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:48:48,517 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:48:48,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:48:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash 201138440, now seen corresponding path program 2 times [2024-09-25 10:48:48,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:48:48,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172846468] [2024-09-25 10:48:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:48:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:48:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:48:48,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:48:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:48:48,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:48:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:48:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:48:48,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:48:48,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172846468] [2024-09-25 10:48:48,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172846468] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:48:48,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999398013] [2024-09-25 10:48:48,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:48:48,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:48:48,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:48:48,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:48:48,647 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:48:48,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:48:48,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:48:48,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 10:48:48,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:48:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:48:48,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:48:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:48:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999398013] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:48:48,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:48:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2024-09-25 10:48:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578919160] [2024-09-25 10:48:48,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:48:48,851 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:48:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:48:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:48:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:48:48,853 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:48:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:48:49,164 INFO L93 Difference]: Finished difference Result 252 states and 292 transitions. [2024-09-25 10:48:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-25 10:48:49,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-09-25 10:48:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:48:49,166 INFO L225 Difference]: With dead ends: 252 [2024-09-25 10:48:49,166 INFO L226 Difference]: Without dead ends: 219 [2024-09-25 10:48:49,167 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2024-09-25 10:48:49,167 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 163 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:48:49,168 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 120 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:48:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-09-25 10:48:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 122. [2024-09-25 10:48:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 101 states have internal predecessors, (117), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 10:48:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2024-09-25 10:48:49,192 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 34 [2024-09-25 10:48:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:48:49,192 INFO L474 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2024-09-25 10:48:49,192 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:48:49,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:48:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2024-09-25 10:48:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-25 10:48:49,196 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:48:49,196 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:48:49,203 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 10:48:49,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:48:49,397 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:48:49,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:48:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -870169238, now seen corresponding path program 4 times [2024-09-25 10:48:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:48:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418813254] [2024-09-25 10:48:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:48:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:48:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:48:49,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315417505] [2024-09-25 10:48:49,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:48:49,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:48:49,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:48:49,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:48:49,443 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:48:49,555 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:48:49,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:48:49,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-25 10:48:49,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:48:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:48:49,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:49:24,252 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)