/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 11:56:40,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 11:56:40,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 11:56:41,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 11:56:41,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 11:56:41,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 11:56:41,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 11:56:41,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 11:56:41,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 11:56:41,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 11:56:41,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 11:56:41,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 11:56:41,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 11:56:41,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 11:56:41,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 11:56:41,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 11:56:41,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 11:56:41,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 11:56:41,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 11:56:41,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 11:56:41,046 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 11:56:41,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 11:56:41,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 11:56:41,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 11:56:41,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 11:56:41,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 11:56:41,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 11:56:41,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 11:56:41,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 11:56:41,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 11:56:41,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 11:56:41,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 11:56:41,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 11:56:41,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 11:56:41,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 11:56:41,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 11:56:41,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 11:56:41,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 11:56:41,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 11:56:41,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 11:56:41,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 11:56:41,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 11:56:41,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-18 11:56:41,083 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 11:56:41,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 11:56:41,084 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-18 11:56:41,084 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-18 11:56:41,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 11:56:41,085 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 11:56:41,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 11:56:41,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 11:56:41,085 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 11:56:41,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 11:56:41,086 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-18 11:56:41,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 11:56:41,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-18 11:56:41,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 11:56:41,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 11:56:41,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 11:56:41,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 11:56:41,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 11:56:41,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 11:56:41,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 11:56:41,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 11:56:41,088 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-18 11:56:41,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-18 11:56:41,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 11:56:41,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-18 11:56:41,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 11:56:41,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 11:56:41,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 11:56:41,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 11:56:41,247 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 11:56:41,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-03-18 11:56:41,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094fb17c4/d09aabef61204e5593f08e7652d8d644/FLAG18cd3316d [2022-03-18 11:56:41,644 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 11:56:41,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-03-18 11:56:41,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094fb17c4/d09aabef61204e5593f08e7652d8d644/FLAG18cd3316d [2022-03-18 11:56:42,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094fb17c4/d09aabef61204e5593f08e7652d8d644 [2022-03-18 11:56:42,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 11:56:42,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 11:56:42,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 11:56:42,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 11:56:42,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 11:56:42,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c91a5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42, skipping insertion in model container [2022-03-18 11:56:42,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 11:56:42,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 11:56:42,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c[322,335] [2022-03-18 11:56:42,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 11:56:42,229 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 11:56:42,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c[322,335] [2022-03-18 11:56:42,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 11:56:42,254 INFO L208 MainTranslator]: Completed translation [2022-03-18 11:56:42,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42 WrapperNode [2022-03-18 11:56:42,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 11:56:42,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 11:56:42,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 11:56:42,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 11:56:42,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 11:56:42,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 11:56:42,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 11:56:42,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 11:56:42,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (1/1) ... [2022-03-18 11:56:42,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 11:56:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:56:42,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-18 11:56:42,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-18 11:56:42,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 11:56:42,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 11:56:42,321 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 11:56:42,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 11:56:42,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 11:56:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 11:56:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 11:56:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 11:56:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 11:56:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 11:56:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 11:56:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 11:56:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 11:56:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 11:56:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 11:56:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 11:56:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 11:56:42,359 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 11:56:42,360 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 11:56:42,473 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 11:56:42,477 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 11:56:42,478 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-18 11:56:42,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:56:42 BoogieIcfgContainer [2022-03-18 11:56:42,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 11:56:42,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 11:56:42,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 11:56:42,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 11:56:42,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 11:56:42" (1/3) ... [2022-03-18 11:56:42,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721b1864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 11:56:42, skipping insertion in model container [2022-03-18 11:56:42,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 11:56:42" (2/3) ... [2022-03-18 11:56:42,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721b1864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 11:56:42, skipping insertion in model container [2022-03-18 11:56:42,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 11:56:42" (3/3) ... [2022-03-18 11:56:42,501 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2022-03-18 11:56:42,506 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 11:56:42,507 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 11:56:42,553 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 11:56:42,558 INFO L340 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-03-18 11:56:42,559 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 11:56:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 11:56:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 11:56:42,587 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:56:42,587 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:56:42,588 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:56:42,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:56:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-03-18 11:56:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:56:42,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207413252] [2022-03-18 11:56:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:56:42,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:56:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:42,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:56:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:56:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207413252] [2022-03-18 11:56:42,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207413252] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:56:42,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 11:56:42,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 11:56:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902184525] [2022-03-18 11:56:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:56:42,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 11:56:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:56:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 11:56:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 11:56:42,735 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:56:42,760 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-03-18 11:56:42,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 11:56:42,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-18 11:56:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:56:42,775 INFO L225 Difference]: With dead ends: 29 [2022-03-18 11:56:42,775 INFO L226 Difference]: Without dead ends: 12 [2022-03-18 11:56:42,777 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 11:56:42,780 INFO L912 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 11:56:42,781 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 11:56:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-03-18 11:56:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-03-18 11:56:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-03-18 11:56:42,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-03-18 11:56:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:56:42,803 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-03-18 11:56:42,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-03-18 11:56:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 11:56:42,803 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:56:42,803 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:56:42,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 11:56:42,804 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:56:42,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:56:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-03-18 11:56:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:56:42,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605832863] [2022-03-18 11:56:42,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:56:42,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:56:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:56:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:56:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605832863] [2022-03-18 11:56:42,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605832863] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 11:56:42,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 11:56:42,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 11:56:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774140438] [2022-03-18 11:56:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 11:56:42,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 11:56:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:56:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 11:56:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 11:56:42,874 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:56:42,895 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-03-18 11:56:42,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 11:56:42,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-18 11:56:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:56:42,896 INFO L225 Difference]: With dead ends: 18 [2022-03-18 11:56:42,896 INFO L226 Difference]: Without dead ends: 13 [2022-03-18 11:56:42,897 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 11:56:42,898 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 11:56:42,898 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 11:56:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-03-18 11:56:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-03-18 11:56:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-03-18 11:56:42,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-03-18 11:56:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:56:42,903 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-03-18 11:56:42,903 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-03-18 11:56:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-18 11:56:42,903 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:56:42,903 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:56:42,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 11:56:42,904 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:56:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:56:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-03-18 11:56:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:56:42,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739883836] [2022-03-18 11:56:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:56:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:56:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:56:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:43,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:56:43,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739883836] [2022-03-18 11:56:43,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739883836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:56:43,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335019817] [2022-03-18 11:56:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:56:43,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:56:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:56:43,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 11:56:43,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-18 11:56:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:43,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-18 11:56:43,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:56:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:43,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:56:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:43,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335019817] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:56:43,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:56:43,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-18 11:56:43,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729727946] [2022-03-18 11:56:43,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:56:43,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 11:56:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:56:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 11:56:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-18 11:56:43,191 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:56:43,289 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-03-18 11:56:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 11:56:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-03-18 11:56:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:56:43,290 INFO L225 Difference]: With dead ends: 21 [2022-03-18 11:56:43,290 INFO L226 Difference]: Without dead ends: 16 [2022-03-18 11:56:43,291 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-18 11:56:43,294 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 11:56:43,295 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 11:56:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-18 11:56:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-03-18 11:56:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-03-18 11:56:43,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-03-18 11:56:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:56:43,303 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-03-18 11:56:43,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-03-18 11:56:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-18 11:56:43,304 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:56:43,304 INFO L500 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:56:43,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-18 11:56:43,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:56:43,521 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:56:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:56:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 2 times [2022-03-18 11:56:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:56:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237227381] [2022-03-18 11:56:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:56:43,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:56:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:56:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:43,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:56:43,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237227381] [2022-03-18 11:56:43,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237227381] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:56:43,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040910258] [2022-03-18 11:56:43,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 11:56:43,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:56:43,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:56:43,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 11:56:43,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-18 11:56:43,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 11:56:43,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:56:43,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-18 11:56:43,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:56:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:43,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:56:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:43,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040910258] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:56:43,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:56:43,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-18 11:56:43,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563317346] [2022-03-18 11:56:43,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:56:43,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 11:56:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:56:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 11:56:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-03-18 11:56:43,797 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:56:44,302 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-03-18 11:56:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 11:56:44,302 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-03-18 11:56:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:56:44,303 INFO L225 Difference]: With dead ends: 27 [2022-03-18 11:56:44,303 INFO L226 Difference]: Without dead ends: 22 [2022-03-18 11:56:44,303 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-03-18 11:56:44,304 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 11:56:44,304 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 11:56:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-03-18 11:56:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-03-18 11:56:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-03-18 11:56:44,308 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2022-03-18 11:56:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:56:44,308 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-03-18 11:56:44,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-03-18 11:56:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-18 11:56:44,309 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:56:44,309 INFO L500 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:56:44,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-18 11:56:44,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-18 11:56:44,519 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:56:44,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:56:44,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 3 times [2022-03-18 11:56:44,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:56:44,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564143676] [2022-03-18 11:56:44,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:56:44,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:56:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:56:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:56:44,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564143676] [2022-03-18 11:56:44,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564143676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:56:44,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610545080] [2022-03-18 11:56:44,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 11:56:44,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:56:44,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:56:44,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 11:56:44,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-18 11:56:44,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-18 11:56:44,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:56:44,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-18 11:56:44,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:56:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:44,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:56:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:45,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610545080] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:56:45,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:56:45,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-03-18 11:56:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533098165] [2022-03-18 11:56:45,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:56:45,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-18 11:56:45,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:56:45,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-18 11:56:45,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-03-18 11:56:45,149 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:56:52,622 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-03-18 11:56:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-18 11:56:52,623 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-18 11:56:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:56:52,623 INFO L225 Difference]: With dead ends: 39 [2022-03-18 11:56:52,624 INFO L226 Difference]: Without dead ends: 34 [2022-03-18 11:56:52,625 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-03-18 11:56:52,625 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 11:56:52,625 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 11:56:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-18 11:56:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-03-18 11:56:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-03-18 11:56:52,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2022-03-18 11:56:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:56:52,631 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-03-18 11:56:52,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:56:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-03-18 11:56:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-18 11:56:52,632 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:56:52,632 INFO L500 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:56:52,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-18 11:56:52,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:56:52,848 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:56:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:56:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 4 times [2022-03-18 11:56:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:56:52,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827355000] [2022-03-18 11:56:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:56:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:56:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:56:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:56:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:53,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:56:53,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827355000] [2022-03-18 11:56:53,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827355000] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:56:53,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166946479] [2022-03-18 11:56:53,283 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 11:56:53,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:56:53,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:56:53,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 11:56:53,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-18 11:56:53,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 11:56:53,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:56:53,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-18 11:56:53,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:56:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:53,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:56:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:56:54,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166946479] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:56:54,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:56:54,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-03-18 11:56:54,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943841991] [2022-03-18 11:56:54,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:56:54,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-18 11:56:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:56:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-18 11:56:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-03-18 11:56:54,316 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:59:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 11:59:07,656 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2022-03-18 11:59:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-18 11:59:07,656 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-03-18 11:59:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 11:59:07,657 INFO L225 Difference]: With dead ends: 63 [2022-03-18 11:59:07,657 INFO L226 Difference]: Without dead ends: 58 [2022-03-18 11:59:07,660 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 134.1s TimeCoverageRelationStatistics Valid=2437, Invalid=6677, Unknown=6, NotChecked=0, Total=9120 [2022-03-18 11:59:07,660 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 11:59:07,661 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 11:59:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-18 11:59:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-03-18 11:59:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:59:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-03-18 11:59:07,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 33 [2022-03-18 11:59:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 11:59:07,673 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-03-18 11:59:07,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 11:59:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-03-18 11:59:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-18 11:59:07,677 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 11:59:07,677 INFO L500 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 11:59:07,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-18 11:59:07,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:59:07,888 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 11:59:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 11:59:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 5 times [2022-03-18 11:59:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 11:59:07,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961526908] [2022-03-18 11:59:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 11:59:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 11:59:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:59:08,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 11:59:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 11:59:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:59:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 11:59:08,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961526908] [2022-03-18 11:59:08,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961526908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 11:59:08,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482205025] [2022-03-18 11:59:08,957 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-18 11:59:08,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 11:59:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 11:59:08,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 11:59:08,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-18 11:59:46,575 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-03-18 11:59:46,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 11:59:46,590 WARN L261 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 95 conjunts are in the unsatisfiable core [2022-03-18 11:59:46,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 11:59:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:59:46,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 11:59:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 11:59:49,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482205025] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 11:59:49,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 11:59:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-03-18 11:59:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344561071] [2022-03-18 11:59:49,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 11:59:49,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-03-18 11:59:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 11:59:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-03-18 11:59:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-03-18 11:59:49,623 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 98 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 12:00:40,848 WARN L232 SmtUtils]: Spent 15.30s on a formula simplification. DAG size of input: 196 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:00:42,861 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 82 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 74 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 78 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 86) 4294967296) 268435455) (< (mod (+ c_main_~x~0 80) 4294967296) 268435455) (< (mod (+ 76 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 88 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 84 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 90 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-18 12:01:53,559 WARN L232 SmtUtils]: Spent 18.67s on a formula simplification. DAG size of input: 182 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:01:55,571 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 82 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 74 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 78 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 86) 4294967296) 268435455) (< (mod (+ c_main_~x~0 80) 4294967296) 268435455) (< (mod (+ 76 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 84 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-18 12:01:57,583 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 82 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 74 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 78 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 80) 4294967296) 268435455) (< (mod (+ 76 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 84 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-18 12:01:59,592 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 82 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 74 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 78 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 80) 4294967296) 268435455) (< (mod (+ 76 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-18 12:02:59,234 WARN L232 SmtUtils]: Spent 12.79s on a formula simplification. DAG size of input: 166 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:03:01,264 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 74 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 78 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 76 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-18 12:04:15,419 WARN L232 SmtUtils]: Spent 20.90s on a formula simplification. DAG size of input: 158 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:05:20,530 WARN L232 SmtUtils]: Spent 13.78s on a formula simplification. DAG size of input: 160 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:05:22,560 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-18 12:06:28,976 WARN L232 SmtUtils]: Spent 10.95s on a formula simplification. DAG size of input: 146 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:07:19,324 WARN L232 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 148 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:08:11,311 WARN L232 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 144 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:09:17,092 WARN L232 SmtUtils]: Spent 7.03s on a formula simplification. DAG size of input: 140 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:10:14,655 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-18 12:11:12,159 WARN L232 SmtUtils]: Spent 7.03s on a formula simplification. DAG size of input: 122 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)