./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2e0d3ed79ba62190a0b501c090bc81fd178363cb7e6ce8cbe0996ce655e2ac6 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 12:23:35,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:23:35,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:23:35,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:23:35,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:23:35,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:23:35,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:23:35,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:23:35,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:23:35,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:23:35,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:23:35,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:23:35,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:23:35,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:23:35,907 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:23:35,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:23:35,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:23:35,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:23:35,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:23:35,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:23:35,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:23:35,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:23:35,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:23:35,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:23:35,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:23:35,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:23:35,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:23:35,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:23:35,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:23:35,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:23:35,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:23:35,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:23:35,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:23:35,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:23:35,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:23:35,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:23:35,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:23:35,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:23:35,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:23:35,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:23:35,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:23:35,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:23:35,921 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 -> a2e0d3ed79ba62190a0b501c090bc81fd178363cb7e6ce8cbe0996ce655e2ac6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 12:23:36,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:23:36,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:23:36,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:23:36,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:23:36,256 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:23:36,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c [2024-09-20 12:23:37,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:23:37,974 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:23:37,975 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c [2024-09-20 12:23:37,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/444e9bf45/ca5c37c55eb949ce8769b5e3e7924a66/FLAGab1495177 [2024-09-20 12:23:38,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/444e9bf45/ca5c37c55eb949ce8769b5e3e7924a66 [2024-09-20 12:23:38,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:23:38,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:23:38,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:23:38,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:23:38,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:23:38,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38, skipping insertion in model container [2024-09-20 12:23:38,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:23:38,567 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/dijkstra-u_valuebound1.c[525,538] [2024-09-20 12:23:38,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:23:38,624 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:23:38,637 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/dijkstra-u_valuebound1.c[525,538] [2024-09-20 12:23:38,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:23:38,682 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:23:38,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38 WrapperNode [2024-09-20 12:23:38,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:23:38,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:23:38,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:23:38,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:23:38,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,709 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:23:38,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:23:38,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:23:38,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:23:38,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:23:38,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,744 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-20 12:23:38,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:23:38,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:23:38,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:23:38,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:23:38,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (1/1) ... [2024-09-20 12:23:38,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:23:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:23:38,816 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-20 12:23:38,818 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-20 12:23:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:23:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 12:23:38,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 12:23:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:23:38,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:23:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:23:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:23:38,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:23:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:23:38,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:23:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:23:38,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:23:38,943 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:23:38,946 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:23:39,226 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-20 12:23:39,227 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:23:39,247 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:23:39,248 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 12:23:39,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:23:39 BoogieIcfgContainer [2024-09-20 12:23:39,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:23:39,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:23:39,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:23:39,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:23:39,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:23:38" (1/3) ... [2024-09-20 12:23:39,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893b8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:23:39, skipping insertion in model container [2024-09-20 12:23:39,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:23:38" (2/3) ... [2024-09-20 12:23:39,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893b8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:23:39, skipping insertion in model container [2024-09-20 12:23:39,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:23:39" (3/3) ... [2024-09-20 12:23:39,261 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound1.c [2024-09-20 12:23:39,276 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:23:39,276 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:23:39,323 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:23:39,329 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;@676dce68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:23:39,330 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:23:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-20 12:23:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-20 12:23:39,343 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:23:39,343 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:23:39,344 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:23:39,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-20 12:23:39,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:23:39,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787714881] [2024-09-20 12:23:39,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:23:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:39,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:23:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:39,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:23:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:39,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:23:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:39,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:23:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787714881] [2024-09-20 12:23:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787714881] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:23:39,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:23:39,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 12:23:39,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396329964] [2024-09-20 12:23:39,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:23:39,569 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 12:23:39,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:23:39,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 12:23:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:23:39,598 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 12:23:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:23:39,645 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-20 12:23:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 12:23:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-20 12:23:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:23:39,663 INFO L225 Difference]: With dead ends: 66 [2024-09-20 12:23:39,664 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 12:23:39,672 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:23:39,677 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:23:39,681 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:23:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 12:23:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-20 12:23:39,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-20 12:23:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-20 12:23:39,729 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-20 12:23:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:23:39,730 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-20 12:23:39,730 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 12:23:39,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-20 12:23:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 12:23:39,735 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:23:39,735 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:23:39,736 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:23:39,736 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:23:39,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:39,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-20 12:23:39,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:23:39,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099144384] [2024-09-20 12:23:39,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:39,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:23:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:40,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:23:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:40,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:23:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:40,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:23:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:23:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099144384] [2024-09-20 12:23:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099144384] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:23:40,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:23:40,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 12:23:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048678200] [2024-09-20 12:23:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:23:40,270 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 12:23:40,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:23:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 12:23:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:23:40,274 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 12:23:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:23:40,628 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-20 12:23:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:23:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-20 12:23:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:23:40,631 INFO L225 Difference]: With dead ends: 64 [2024-09-20 12:23:40,631 INFO L226 Difference]: Without dead ends: 46 [2024-09-20 12:23:40,632 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:23:40,633 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-20 12:23:40,634 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-20 12:23:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-20 12:23:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-20 12:23:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-20 12:23:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-20 12:23:40,667 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-20 12:23:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:23:40,667 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-20 12:23:40,668 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 12:23:40,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-20 12:23:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-20 12:23:40,670 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:23:40,670 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:23:40,670 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:23:40,670 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:23:40,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:23:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-20 12:23:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:23:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492642760] [2024-09-20 12:23:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:23:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:41,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:23:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:41,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:23:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:41,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:23:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:41,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:23:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492642760] [2024-09-20 12:23:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492642760] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:23:41,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916183515] [2024-09-20 12:23:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:23:41,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:23:41,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:23:41,064 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-20 12:23:41,065 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-20 12:23:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:23:41,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-20 12:23:41,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:23:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:41,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:23:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 12:23:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916183515] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:23:41,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:23:41,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-20 12:23:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883071287] [2024-09-20 12:23:41,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:23:41,516 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-20 12:23:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:23:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-20 12:23:41,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-20 12:23:41,519 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 12:23:46,553 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-20 12:23:50,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:23:54,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:23:59,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:03,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:07,725 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-20 12:24:11,740 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-20 12:24:15,827 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-20 12:24:19,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:24,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:28,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:32,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:24:32,475 INFO L93 Difference]: Finished difference Result 137 states and 220 transitions. [2024-09-20 12:24:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 12:24:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-20 12:24:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:24:32,478 INFO L225 Difference]: With dead ends: 137 [2024-09-20 12:24:32,479 INFO L226 Difference]: Without dead ends: 119 [2024-09-20 12:24:32,481 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-09-20 12:24:32,482 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 137 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.7s IncrementalHoareTripleChecker+Time [2024-09-20 12:24:32,483 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 398 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 283 Invalid, 12 Unknown, 0 Unchecked, 50.7s Time] [2024-09-20 12:24:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-09-20 12:24:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 71. [2024-09-20 12:24:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.263157894736842) internal successors, (48), 41 states have internal predecessors, (48), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-20 12:24:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-09-20 12:24:32,516 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 25 [2024-09-20 12:24:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:24:32,517 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-09-20 12:24:32,517 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 12:24:32,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:24:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-09-20 12:24:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-20 12:24:32,519 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:24:32,519 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:24:32,538 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 12:24:32,723 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-20 12:24:32,724 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:24:32,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:24:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-20 12:24:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:24:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560169002] [2024-09-20 12:24:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:24:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:24:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 12:24:32,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107955180] [2024-09-20 12:24:32,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:24:32,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:24:32,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:24:32,773 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-20 12:24:32,774 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-20 12:24:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:32,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-20 12:24:32,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:24:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-20 12:24:32,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:24:32,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:24:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560169002] [2024-09-20 12:24:32,948 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 12:24:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107955180] [2024-09-20 12:24:32,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107955180] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:24:32,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:24:32,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 12:24:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636628184] [2024-09-20 12:24:32,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:24:32,950 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 12:24:32,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:24:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 12:24:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 12:24:32,952 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 12:24:37,105 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-20 12:24:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:24:37,128 INFO L93 Difference]: Finished difference Result 98 states and 139 transitions. [2024-09-20 12:24:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 12:24:37,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-20 12:24:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:24:37,131 INFO L225 Difference]: With dead ends: 98 [2024-09-20 12:24:37,132 INFO L226 Difference]: Without dead ends: 95 [2024-09-20 12:24:37,132 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 12:24:37,133 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:24:37,133 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-09-20 12:24:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-20 12:24:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-20 12:24:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 50 states have internal predecessors, (58), 40 states have call successors, (40), 8 states have call predecessors, (40), 7 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-09-20 12:24:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-09-20 12:24:37,169 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 33 [2024-09-20 12:24:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:24:37,170 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-09-20 12:24:37,170 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 12:24:37,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:24:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-09-20 12:24:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-20 12:24:37,172 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:24:37,172 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:24:37,190 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 12:24:37,377 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:24:37,377 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:24:37,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:24:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-20 12:24:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:24:37,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557701753] [2024-09-20 12:24:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:24:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:24:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:37,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:24:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:37,573 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:24:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:37,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:24:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:37,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 12:24:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 12:24:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:24:37,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557701753] [2024-09-20 12:24:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557701753] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:24:37,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905348132] [2024-09-20 12:24:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:24:37,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:24:37,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:24:37,639 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-20 12:24:37,640 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-20 12:24:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:37,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 12:24:37,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:24:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-20 12:24:37,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:24:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 12:24:37,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905348132] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:24:37,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:24:37,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-09-20 12:24:37,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446938603] [2024-09-20 12:24:37,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:24:37,994 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 12:24:37,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:24:37,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 12:24:37,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-20 12:24:37,995 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-20 12:24:39,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:43,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:24:43,470 INFO L93 Difference]: Finished difference Result 124 states and 171 transitions. [2024-09-20 12:24:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 12:24:43,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2024-09-20 12:24:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:24:43,473 INFO L225 Difference]: With dead ends: 124 [2024-09-20 12:24:43,473 INFO L226 Difference]: Without dead ends: 78 [2024-09-20 12:24:43,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-09-20 12:24:43,474 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 28 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-09-20 12:24:43,475 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 320 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 116 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-09-20 12:24:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-20 12:24:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-09-20 12:24:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 34 states have (on average 1.088235294117647) internal successors, (37), 37 states have internal predecessors, (37), 33 states have call successors, (33), 8 states have call predecessors, (33), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-20 12:24:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2024-09-20 12:24:43,499 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 32 [2024-09-20 12:24:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:24:43,499 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2024-09-20 12:24:43,499 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-20 12:24:43,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:24:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2024-09-20 12:24:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-20 12:24:43,501 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:24:43,501 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:24:43,522 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 12:24:43,702 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:24:43,703 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:24:43,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:24:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-20 12:24:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:24:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977952890] [2024-09-20 12:24:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:24:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:24:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 12:24:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839210057] [2024-09-20 12:24:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:24:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:24:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:24:43,770 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-20 12:24:43,771 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-20 12:24:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:43,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-20 12:24:43,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:24:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-20 12:24:44,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:24:49,323 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-09-20 12:24:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:24:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977952890] [2024-09-20 12:24:49,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 12:24:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839210057] [2024-09-20 12:24:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839210057] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:24:49,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-20 12:24:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-20 12:24:49,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997426365] [2024-09-20 12:24:49,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-20 12:24:49,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 12:24:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:24:49,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 12:24:49,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-20 12:24:49,332 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-20 12:24:53,811 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-20 12:24:57,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 12:24:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:24:57,880 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2024-09-20 12:24:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:24:57,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-09-20 12:24:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:24:57,882 INFO L225 Difference]: With dead ends: 89 [2024-09-20 12:24:57,882 INFO L226 Difference]: Without dead ends: 67 [2024-09-20 12:24:57,883 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-20 12:24:57,884 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-09-20 12:24:57,884 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 133 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-09-20 12:24:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-20 12:24:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-20 12:24:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (26), 8 states have call predecessors, (26), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-20 12:24:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-09-20 12:24:57,904 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 59 [2024-09-20 12:24:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:24:57,905 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-09-20 12:24:57,906 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-20 12:24:57,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:24:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-09-20 12:24:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-20 12:24:57,912 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:24:57,912 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:24:57,933 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 12:24:58,113 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:24:58,113 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:24:58,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:24:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-20 12:24:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:24:58,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512498192] [2024-09-20 12:24:58,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:24:58,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:24:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:24:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:24:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 12:24:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 12:24:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-20 12:24:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-20 12:24:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 12:24:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-20 12:24:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-20 12:24:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-20 12:24:59,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:24:59,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512498192] [2024-09-20 12:24:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512498192] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:24:59,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775244299] [2024-09-20 12:24:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:24:59,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:24:59,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:24:59,694 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-20 12:24:59,695 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-20 12:24:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:24:59,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-20 12:24:59,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:25:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-20 12:25:00,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:25:27,361 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-20 12:25:47,880 WARN L293 SmtUtils]: Spent 12.09s 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-20 12:26:00,371 WARN L293 SmtUtils]: Spent 12.48s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:26:08,534 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:26:28,966 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:26:38,427 WARN L293 SmtUtils]: Spent 9.15s 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-20 12:26:46,527 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:27:02,937 WARN L293 SmtUtils]: Spent 16.19s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-20 12:27:10,996 WARN L293 SmtUtils]: Spent 8.05s 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-20 12:27:27,404 WARN L293 SmtUtils]: Spent 12.35s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:27:47,723 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~q~0 1073741824))) (or (< (mod c_main_~r~0 4294967296) (mod (+ c_main_~p~0 .cse0) 4294967296)) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 c_main_~p~0 4294967280) (* c_main_~q~0 c_main_~p~0 c_main_~r~0 4294967280) (* c_main_~q~0 c_main_~n~0 4294967280 c_main_~h~0) (* c_main_~q~0 16 c_main_~r~0 c_main_~h~0) (* c_main_~p~0 c_main_~h~0 c_main_~h~0) (* c_main_~q~0 16 c_main_~p~0 c_main_~n~0)) 4294967296) 0)) (< (* 4 .cse0) (+ (mod c_main_~n~0 4294967296) 1)) (< (mod (+ c_main_~r~0 (* 4294967295 .cse0) (* 4294967295 c_main_~p~0)) 4294967296) (mod (+ (* 3 .cse0) (* 4294967295 (mod c_main_~p~0 2)) c_main_~p~0) 4294967296)))) is different from true [2024-09-20 12:27:59,860 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:28:07,925 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 12:28:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 2 not checked. [2024-09-20 12:28:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775244299] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:28:08,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:28:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 27 [2024-09-20 12:28:08,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413720005] [2024-09-20 12:28:08,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:28:08,010 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-20 12:28:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:28:08,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-20 12:28:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=559, Unknown=3, NotChecked=48, Total=702 [2024-09-20 12:28:08,012 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 22 states have internal predecessors, (47), 9 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2024-09-20 12:28:13,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []