/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 21:27:40,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:27:40,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:27:40,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:27:40,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:27:40,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:27:40,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:27:40,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:27:40,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:27:40,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:27:40,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:27:40,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:27:40,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:27:40,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:27:40,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:27:40,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:27:40,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:27:40,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:27:40,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:27:40,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:27:40,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:27:40,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:27:40,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:27:40,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:27:40,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:27:40,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:27:40,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:27:40,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:27:40,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:27:40,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:27:40,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:27:40,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:27:40,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:27:40,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:27:40,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:27:40,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:27:40,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:27:40,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:27:40,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:27:40,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:27:40,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:27:40,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:27:40,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:27:40,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:27:40,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:27:40,484 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:27:40,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:27:40,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:27:40,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:27:40,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:27:40,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:27:40,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:27:40,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:27:40,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:27:40,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:27:40,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:27:40,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:27:40,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:27:40,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:27:40,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:27:40,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:27:40,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:27:40,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:27:40,486 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:27:40,486 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-02-14 21:27:40,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:27:40,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:27:40,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:27:40,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:27:40,685 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:27:40,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-2.c [2022-02-14 21:27:40,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f09a0f17/f8a89fa81ae44f51b73f68f9ebaa5e6b/FLAGec9edecc5 [2022-02-14 21:27:41,080 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:27:41,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-2.c [2022-02-14 21:27:41,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f09a0f17/f8a89fa81ae44f51b73f68f9ebaa5e6b/FLAGec9edecc5 [2022-02-14 21:27:41,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f09a0f17/f8a89fa81ae44f51b73f68f9ebaa5e6b [2022-02-14 21:27:41,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:27:41,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:27:41,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:27:41,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:27:41,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:27:41,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d780e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41, skipping insertion in model container [2022-02-14 21:27:41,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:27:41,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:27:41,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-2.c[321,334] [2022-02-14 21:27:41,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:27:41,250 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:27:41,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-2.c[321,334] [2022-02-14 21:27:41,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:27:41,273 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:27:41,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41 WrapperNode [2022-02-14 21:27:41,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:27:41,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:27:41,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:27:41,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:27:41,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:27:41,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:27:41,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:27:41,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:27:41,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:27:41,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:27:41,340 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-02-14 21:27:41,355 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-02-14 21:27:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:27:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:27:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:27:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:27:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:27:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:27:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:27:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:27:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:27:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:27:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:27:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:27:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:27:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:27:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:27:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:27:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:27:41,432 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:27:41,433 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:27:41,513 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:27:41,517 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:27:41,517 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-14 21:27:41,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:27:41 BoogieIcfgContainer [2022-02-14 21:27:41,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:27:41,519 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:27:41,519 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:27:41,523 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:27:41,525 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:27:41" (1/1) ... [2022-02-14 21:27:41,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:27:41 BasicIcfg [2022-02-14 21:27:41,535 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:27:41,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:27:41,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:27:41,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:27:41,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:27:41" (1/4) ... [2022-02-14 21:27:41,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3653d3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:27:41, skipping insertion in model container [2022-02-14 21:27:41,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:27:41" (2/4) ... [2022-02-14 21:27:41,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3653d3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:27:41, skipping insertion in model container [2022-02-14 21:27:41,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:27:41" (3/4) ... [2022-02-14 21:27:41,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3653d3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:27:41, skipping insertion in model container [2022-02-14 21:27:41,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:27:41" (4/4) ... [2022-02-14 21:27:41,551 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-2.cJordan [2022-02-14 21:27:41,554 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:27:41,554 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:27:41,584 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:27:41,589 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 21:27:41,589 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:27:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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-02-14 21:27:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-14 21:27:41,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:27:41,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:27:41,602 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:27:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:27:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1895308246, now seen corresponding path program 1 times [2022-02-14 21:27:41,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:27:41,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975286716] [2022-02-14 21:27:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:27:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:27:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:41,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:27:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:41,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:27:41,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975286716] [2022-02-14 21:27:41,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975286716] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:27:41,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:27:41,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:27:41,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677136853] [2022-02-14 21:27:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:27:41,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:27:41,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:27:41,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:27:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:27:41,806 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-02-14 21:27:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:27:41,861 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-02-14 21:27:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:27:41,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-02-14 21:27:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:27:41,866 INFO L225 Difference]: With dead ends: 28 [2022-02-14 21:27:41,867 INFO L226 Difference]: Without dead ends: 23 [2022-02-14 21:27:41,868 INFO L932 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-02-14 21:27:41,871 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 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-02-14 21:27:41,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:27:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-14 21:27:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-14 21:27:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-14 21:27:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-14 21:27:41,890 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-02-14 21:27:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:27:41,890 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-14 21:27:41,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-02-14 21:27:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-14 21:27:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-14 21:27:41,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:27:41,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:27:41,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:27:41,891 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:27:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:27:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1894384725, now seen corresponding path program 1 times [2022-02-14 21:27:41,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:27:41,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074054648] [2022-02-14 21:27:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:27:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:27:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:41,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:27:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:41,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:27:41,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074054648] [2022-02-14 21:27:41,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074054648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:27:41,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:27:41,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 21:27:41,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713509010] [2022-02-14 21:27:41,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:27:41,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-14 21:27:41,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:27:41,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-14 21:27:41,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-14 21:27:41,980 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-02-14 21:27:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:27:42,033 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-14 21:27:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-14 21:27:42,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-02-14 21:27:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:27:42,035 INFO L225 Difference]: With dead ends: 32 [2022-02-14 21:27:42,035 INFO L226 Difference]: Without dead ends: 32 [2022-02-14 21:27:42,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-02-14 21:27:42,036 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:27:42,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:27:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-14 21:27:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-02-14 21:27:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-14 21:27:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-02-14 21:27:42,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-02-14 21:27:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:27:42,040 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-02-14 21:27:42,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-02-14 21:27:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-14 21:27:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:27:42,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:27:42,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:27:42,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:27:42,041 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:27:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:27:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1473809801, now seen corresponding path program 1 times [2022-02-14 21:27:42,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:27:42,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920957934] [2022-02-14 21:27:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:27:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:27:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:27:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:42,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:27:42,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920957934] [2022-02-14 21:27:42,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920957934] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:27:42,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234343569] [2022-02-14 21:27:42,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:27:42,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:27:42,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:27:42,137 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-02-14 21:27:42,138 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-02-14 21:27:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:42,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-14 21:27:42,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:27:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:42,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:27:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:42,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234343569] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:27:42,323 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:27:42,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-02-14 21:27:42,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486395254] [2022-02-14 21:27:42,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:27:42,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:27:42,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:27:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:27:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-14 21:27:42,326 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-02-14 21:27:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:27:42,448 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-02-14 21:27:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 21:27:42,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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 17 [2022-02-14 21:27:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:27:42,450 INFO L225 Difference]: With dead ends: 37 [2022-02-14 21:27:42,450 INFO L226 Difference]: Without dead ends: 37 [2022-02-14 21:27:42,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 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-02-14 21:27:42,451 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:27:42,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 41 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 21:27:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-14 21:27:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-02-14 21:27:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-14 21:27:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-14 21:27:42,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2022-02-14 21:27:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:27:42,454 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-14 21:27:42,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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-02-14 21:27:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-14 21:27:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 21:27:42,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:27:42,455 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:27:42,475 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-02-14 21:27:42,669 WARN L452 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-02-14 21:27:42,669 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:27:42,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:27:42,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1878931933, now seen corresponding path program 2 times [2022-02-14 21:27:42,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:27:42,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416263751] [2022-02-14 21:27:42,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:27:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:27:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:27:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:42,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:27:42,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416263751] [2022-02-14 21:27:42,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416263751] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:27:42,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983363980] [2022-02-14 21:27:42,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:27:42,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:27:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:27:42,790 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-02-14 21:27:42,791 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-02-14 21:27:42,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:27:42,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:27:42,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-14 21:27:42,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:27:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:42,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:27:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:43,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983363980] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:27:43,045 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:27:43,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-02-14 21:27:43,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949083542] [2022-02-14 21:27:43,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:27:43,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 21:27:43,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:27:43,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 21:27:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-14 21:27:43,054 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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-02-14 21:27:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:27:43,395 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-02-14 21:27:43,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-14 21:27:43,395 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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 23 [2022-02-14 21:27:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:27:43,396 INFO L225 Difference]: With dead ends: 49 [2022-02-14 21:27:43,396 INFO L226 Difference]: Without dead ends: 49 [2022-02-14 21:27:43,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-02-14 21:27:43,397 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 117 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:27:43,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 51 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 21:27:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-14 21:27:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-02-14 21:27:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-14 21:27:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-02-14 21:27:43,401 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 23 [2022-02-14 21:27:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:27:43,401 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-14 21:27:43,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 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-02-14 21:27:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-14 21:27:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-14 21:27:43,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:27:43,402 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:27:43,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-14 21:27:43,615 WARN L452 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-02-14 21:27:43,616 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:27:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:27:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash -607664937, now seen corresponding path program 3 times [2022-02-14 21:27:43,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:27:43,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623002094] [2022-02-14 21:27:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:27:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:27:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:27:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:43,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:27:43,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623002094] [2022-02-14 21:27:43,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623002094] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:27:43,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305247000] [2022-02-14 21:27:43,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 21:27:43,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:27:43,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:27:43,799 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-02-14 21:27:43,829 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-02-14 21:27:43,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-14 21:27:43,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:27:43,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-14 21:27:43,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:27:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:43,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:27:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:44,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305247000] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:27:44,251 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:27:44,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-02-14 21:27:44,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141477033] [2022-02-14 21:27:44,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:27:44,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-14 21:27:44,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:27:44,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-14 21:27:44,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-02-14 21:27:44,253 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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-02-14 21:27:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:27:49,836 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-02-14 21:27:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-14 21:27:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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 35 [2022-02-14 21:27:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:27:49,837 INFO L225 Difference]: With dead ends: 73 [2022-02-14 21:27:49,838 INFO L226 Difference]: Without dead ends: 73 [2022-02-14 21:27:49,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-02-14 21:27:49,839 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 110 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-14 21:27:49,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 86 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-14 21:27:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-14 21:27:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2022-02-14 21:27:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-14 21:27:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-02-14 21:27:49,845 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2022-02-14 21:27:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:27:49,845 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-02-14 21:27:49,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 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-02-14 21:27:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-02-14 21:27:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-14 21:27:49,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:27:49,847 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:27:49,863 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-02-14 21:27:50,049 WARN L452 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-02-14 21:27:50,049 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:27:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:27:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash -943491009, now seen corresponding path program 4 times [2022-02-14 21:27:50,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:27:50,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386904275] [2022-02-14 21:27:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:27:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:27:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:27:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:50,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:27:50,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386904275] [2022-02-14 21:27:50,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386904275] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:27:50,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211880126] [2022-02-14 21:27:50,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-14 21:27:50,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:27:50,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:27:50,470 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-02-14 21:27:50,496 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-02-14 21:27:50,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-14 21:27:50,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:27:50,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-14 21:27:50,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:27:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:50,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:27:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:27:51,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211880126] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:27:51,711 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:27:51,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-02-14 21:27:51,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856469765] [2022-02-14 21:27:51,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:27:51,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-14 21:27:51,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:27:51,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-14 21:27:51,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-02-14 21:27:51,713 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 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-02-14 21:29:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:29:41,982 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-02-14 21:29:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-14 21:29:41,983 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 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) Word has length 59 [2022-02-14 21:29:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:29:41,984 INFO L225 Difference]: With dead ends: 121 [2022-02-14 21:29:41,984 INFO L226 Difference]: Without dead ends: 121 [2022-02-14 21:29:41,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 110.5s TimeCoverageRelationStatistics Valid=2441, Invalid=6677, Unknown=2, NotChecked=0, Total=9120 [2022-02-14 21:29:41,986 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 242 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-14 21:29:41,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 141 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-14 21:29:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-14 21:29:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2022-02-14 21:29:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-14 21:29:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2022-02-14 21:29:41,991 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 59 [2022-02-14 21:29:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:29:41,992 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2022-02-14 21:29:41,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 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-02-14 21:29:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-02-14 21:29:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-14 21:29:41,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:29:41,994 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:29:42,012 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-02-14 21:29:42,207 WARN L452 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-02-14 21:29:42,207 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:29:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:29:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1664764145, now seen corresponding path program 5 times [2022-02-14 21:29:42,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:29:42,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556493848] [2022-02-14 21:29:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:29:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:29:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:29:43,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:29:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:29:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:29:43,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:29:43,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556493848] [2022-02-14 21:29:43,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556493848] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:29:43,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129796434] [2022-02-14 21:29:43,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-14 21:29:43,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:29:43,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:29:43,341 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-02-14 21:29:43,342 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-02-14 21:31:50,523 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-14 21:31:50,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:31:50,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 95 conjunts are in the unsatisfiable core [2022-02-14 21:31:50,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:31:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:31:50,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:31:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:31:54,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129796434] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:31:54,235 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:31:54,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-02-14 21:31:54,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133858247] [2022-02-14 21:31:54,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:31:54,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-02-14 21:31:54,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:31:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-02-14 21:31:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-02-14 21:31:54,239 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 98 states, 98 states have (on average 2.0408163265306123) internal successors, (200), 97 states have internal predecessors, (200), 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-02-14 21:32:38,563 WARN L228 SmtUtils]: Spent 8.47s 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-02-14 21:33:38,133 WARN L228 SmtUtils]: Spent 14.68s on a formula simplification. DAG size of input: 192 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:33:40,142 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ 44 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ 42 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 43) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-02-14 21:34:40,560 WARN L228 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 180 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:35:34,670 WARN L228 SmtUtils]: Spent 13.08s on a formula simplification. DAG size of input: 184 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:35:36,685 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ 42 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-02-14 21:36:40,117 WARN L228 SmtUtils]: Spent 12.91s on a formula simplification. DAG size of input: 172 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:37:42,547 WARN L228 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 176 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:38:36,304 WARN L228 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 172 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:39:33,116 WARN L228 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 168 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:40:30,657 WARN L228 SmtUtils]: Spent 11.71s on a formula simplification. DAG size of input: 164 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:40:32,681 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-02-14 21:40:34,692 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-02-14 21:41:45,575 WARN L228 SmtUtils]: Spent 10.07s on a formula simplification. DAG size of input: 150 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)