./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound20.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 de325976 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/geo3-ll_valuebound20.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 4c04ff4ba89c203752c2536888693b0490a6d8d55183f07b2fd5c1dc6af9f21c --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-de32597-m [2024-09-17 18:58:46,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:58:46,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 18:58:46,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:58:46,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:58:46,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:58:46,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:58:46,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:58:46,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:58:47,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:58:47,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:58:47,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:58:47,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:58:47,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:58:47,003 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:58:47,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:58:47,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:58:47,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:58:47,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 18:58:47,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:58:47,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:58:47,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:58:47,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:58:47,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:58:47,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:58:47,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:58:47,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:58:47,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:58:47,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:58:47,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:58:47,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:58:47,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:58:47,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:58:47,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:58:47,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:58:47,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:58:47,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 18:58:47,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 18:58:47,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:58:47,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:58:47,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:58:47,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:58:47,012 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 -> 4c04ff4ba89c203752c2536888693b0490a6d8d55183f07b2fd5c1dc6af9f21c 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-17 18:58:47,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:58:47,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:58:47,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:58:47,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:58:47,302 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:58:47,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound20.c [2024-09-17 18:58:48,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:58:48,877 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:58:48,878 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound20.c [2024-09-17 18:58:48,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/695a238ad/e4e6ab59269c4083994e0cc0672d3c50/FLAG78c536c38 [2024-09-17 18:58:49,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/695a238ad/e4e6ab59269c4083994e0cc0672d3c50 [2024-09-17 18:58:49,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:58:49,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:58:49,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:58:49,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:58:49,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:58:49,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2abb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49, skipping insertion in model container [2024-09-17 18:58:49,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:58:49,431 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/geo3-ll_valuebound20.c[524,537] [2024-09-17 18:58:49,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:58:49,456 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:58:49,466 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/geo3-ll_valuebound20.c[524,537] [2024-09-17 18:58:49,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:58:49,487 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:58:49,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49 WrapperNode [2024-09-17 18:58:49,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:58:49,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:58:49,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:58:49,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:58:49,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,515 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:58:49,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:58:49,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:58:49,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:58:49,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:58:49,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,556 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-17 18:58:49,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:58:49,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:58:49,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:58:49,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:58:49,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (1/1) ... [2024-09-17 18:58:49,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:58:49,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:58:49,599 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-17 18:58:49,602 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-17 18:58:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:58:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 18:58:49,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 18:58:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:58:49,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:58:49,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 18:58:49,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:58:49,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:58:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:58:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:58:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 18:58:49,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 18:58:49,718 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:58:49,720 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:58:49,920 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-17 18:58:49,920 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:58:49,950 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:58:49,950 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-17 18:58:49,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:58:49 BoogieIcfgContainer [2024-09-17 18:58:49,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:58:49,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:58:49,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:58:49,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:58:49,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:58:49" (1/3) ... [2024-09-17 18:58:49,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6699f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:58:49, skipping insertion in model container [2024-09-17 18:58:49,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:58:49" (2/3) ... [2024-09-17 18:58:49,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6699f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:58:49, skipping insertion in model container [2024-09-17 18:58:49,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:58:49" (3/3) ... [2024-09-17 18:58:49,961 INFO L112 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound20.c [2024-09-17 18:58:49,978 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:58:49,978 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 18:58:50,025 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:58:50,030 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;@410069a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:58:50,031 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 18:58:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-17 18:58:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-17 18:58:50,042 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:58:50,042 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:58:50,043 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:58:50,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:58:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -839968477, now seen corresponding path program 1 times [2024-09-17 18:58:50,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:58:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127168815] [2024-09-17 18:58:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:58:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:58:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:58:50,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:58:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:58:50,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:58:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:58:50,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:58:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:58:50,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:58:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:58:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 18:58:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:58:50,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127168815] [2024-09-17 18:58:50,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127168815] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:58:50,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:58:50,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-17 18:58:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644253603] [2024-09-17 18:58:50,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:58:50,248 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-17 18:58:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:58:50,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-17 18:58:50,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-17 18:58:50,268 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 18:58:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:58:50,293 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2024-09-17 18:58:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-17 18:58:50,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-17 18:58:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:58:50,303 INFO L225 Difference]: With dead ends: 52 [2024-09-17 18:58:50,303 INFO L226 Difference]: Without dead ends: 25 [2024-09-17 18:58:50,306 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-17 18:58:50,310 INFO L434 NwaCegarLoop]: 30 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, 30 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-17 18:58:50,311 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:58:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-17 18:58:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-17 18:58:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-17 18:58:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-09-17 18:58:50,353 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2024-09-17 18:58:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:58:50,354 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-09-17 18:58:50,354 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 18:58:50,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:58:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-09-17 18:58:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-17 18:58:50,358 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:58:50,358 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:58:50,359 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 18:58:50,359 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:58:50,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:58:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1024519709, now seen corresponding path program 1 times [2024-09-17 18:58:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:58:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521901634] [2024-09-17 18:58:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:58:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:58:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 18:58:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985000270] [2024-09-17 18:58:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:58:50,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:58:50,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:58:50,439 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-17 18:58:50,441 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-17 18:58:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:58:50,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-17 18:58:50,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:58:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 18:58:50,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:58:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:58:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521901634] [2024-09-17 18:58:50,676 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 18:58:50,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985000270] [2024-09-17 18:58:50,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985000270] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:58:50,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:58:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:58:50,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704447335] [2024-09-17 18:58:50,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:58:50,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:58:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:58:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:58:50,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:58:50,681 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-17 18:58:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:58:50,732 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-09-17 18:58:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 18:58:50,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-09-17 18:58:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:58:50,734 INFO L225 Difference]: With dead ends: 35 [2024-09-17 18:58:50,734 INFO L226 Difference]: Without dead ends: 32 [2024-09-17 18:58:50,735 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:58:50,737 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 18:58:50,738 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:58:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-17 18:58:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-17 18:58:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-17 18:58:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-09-17 18:58:50,754 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 28 [2024-09-17 18:58:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:58:50,756 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-09-17 18:58:50,757 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-17 18:58:50,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:58:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-09-17 18:58:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-17 18:58:50,760 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:58:50,761 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-17 18:58:50,779 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-17 18:58:50,966 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:58:50,967 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:58:50,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:58:50,968 INFO L85 PathProgramCache]: Analyzing trace with hash 535256771, now seen corresponding path program 1 times [2024-09-17 18:58:50,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:58:50,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426830667] [2024-09-17 18:58:50,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:58:50,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:58:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 18:58:51,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122349233] [2024-09-17 18:58:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:58:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:58:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:58:51,031 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-17 18:58:51,034 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-17 18:58:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:58:51,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-17 18:58:51,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:58:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 18:58:51,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:58:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 18:58:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:58:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426830667] [2024-09-17 18:58:59,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 18:58:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122349233] [2024-09-17 18:58:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122349233] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:58:59,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 18:58:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-09-17 18:58:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503055020] [2024-09-17 18:58:59,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 18:58:59,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-17 18:58:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:58:59,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-17 18:58:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2024-09-17 18:58:59,851 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-17 18:59:08,303 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-17 18:59:12,317 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-17 18:59:16,324 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-17 18:59:20,334 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-17 18:59:24,340 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-17 18:59:28,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-17 18:59:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:59:28,421 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-09-17 18:59:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:59:28,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2024-09-17 18:59:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:59:28,422 INFO L225 Difference]: With dead ends: 50 [2024-09-17 18:59:28,422 INFO L226 Difference]: Without dead ends: 45 [2024-09-17 18:59:28,423 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2024-09-17 18:59:28,426 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-09-17 18:59:28,426 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 158 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2024-09-17 18:59:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-17 18:59:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-17 18:59:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-17 18:59:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-09-17 18:59:28,442 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 35 [2024-09-17 18:59:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:59:28,443 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-09-17 18:59:28,443 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-17 18:59:28,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:59:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-09-17 18:59:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-17 18:59:28,445 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:59:28,445 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:59:28,463 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-17 18:59:28,649 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:59:28,650 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:59:28,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:59:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -549742109, now seen corresponding path program 2 times [2024-09-17 18:59:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:59:28,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958710506] [2024-09-17 18:59:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:59:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:59:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 18:59:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957788550] [2024-09-17 18:59:28,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-17 18:59:28,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:59:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:59:28,719 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-17 18:59:28,720 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-17 18:59:28,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-17 18:59:28,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 18:59:28,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-17 18:59:28,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:59:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-17 18:59:29,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:00:35,163 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 19:00:56,065 WARN L293 SmtUtils]: Spent 12.21s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 19:01:00,077 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse0 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse0 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< 0 .cse0)))) (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse1 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse1 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< .cse1 1))))))) is different from true [2024-09-17 19:01:20,236 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 19:01:40,274 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 19:02:00,999 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 19:02:21,249 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 19:02:25,257 WARN L854 $PredicateComparison]: unable to prove that (or (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse0 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse0 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< 0 .cse0)))) (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse1 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse1 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< .cse1 1))))))) (= c___VERIFIER_assert_~cond 0)) is different from false [2024-09-17 19:02:29,264 WARN L876 $PredicateComparison]: unable to prove that (or (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse0 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse0 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< 0 .cse0)))) (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse1 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse1 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< .cse1 1))))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-17 19:02:49,349 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 19:03:09,412 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 19:03:13,424 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse0 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse0 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< 0 .cse0)))) (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse1 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse1 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< .cse1 1)))))) is different from true [2024-09-17 19:03:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 2 not checked. [2024-09-17 19:03:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:03:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958710506] [2024-09-17 19:03:13,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 19:03:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957788550] [2024-09-17 19:03:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957788550] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:03:13,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:03:13,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2024-09-17 19:03:13,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048111754] [2024-09-17 19:03:13,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:03:13,486 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-17 19:03:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:03:13,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-17 19:03:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=251, Unknown=5, NotChecked=102, Total=420 [2024-09-17 19:03:13,488 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 9 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-17 19:03:17,742 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| 1))) (and (or (not .cse0) (and (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse1 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse1 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< 0 .cse1)))) (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse2 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse2 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< .cse2 1)))))) .cse0)) is different from false [2024-09-17 19:03:21,780 WARN L854 $PredicateComparison]: unable to prove that (and (or (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse0 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse0 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< 0 .cse0)))) (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~y~0_BEFORE_CALL_10 Int) (v_main_~az~0_BEFORE_CALL_10 Int)) (let ((.cse1 (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616))) (or (= 0 (mod (+ (* 18446744073709551615 .cse1 v_main_~z~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_10 v_main_~az~0_BEFORE_CALL_10) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_10)) 18446744073709551616)) (< .cse1 1))))))) (= c___VERIFIER_assert_~cond 0)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= c___VERIFIER_assert_~cond 1)) is different from false