/usr/bin/java -ea -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/locks/test_locks_14-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:20:18,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:20:18,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:20:18,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:20:18,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:20:18,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:20:18,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:20:18,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:20:18,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:20:18,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:20:18,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:20:18,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:20:18,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:20:18,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:20:18,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:20:18,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:20:18,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:20:18,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:20:18,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:20:18,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:20:18,695 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:20:18,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:20:18,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:20:18,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:20:18,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:20:18,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:20:18,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:20:18,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:20:18,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:20:18,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:20:18,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:20:18,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:20:18,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:20:18,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:20:18,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:20:18,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:20:18,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:20:18,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:20:18,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:20:18,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:20:18,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:20:18,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:20:18,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 21:20:18,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:20:18,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:20:18,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:20:18,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 21:20:18,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:20:18,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 21:20:18,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:20:18,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:20:18,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:20:18,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:20:18,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 21:20:18,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:20:18,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:20:18,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:20:18,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:20:18,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:20:18,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 21:20:18,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:20:18,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:18,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:20:18,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:20:18,722 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:20:18,722 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-04-07 21:20:18,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:20:18,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:20:18,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:20:18,930 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:20:18,930 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:20:18,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-2.c [2022-04-07 21:20:18,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094009a17/da209ddd724c4941a44e834946847489/FLAGfa7d76991 [2022-04-07 21:20:19,288 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:20:19,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c [2022-04-07 21:20:19,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094009a17/da209ddd724c4941a44e834946847489/FLAGfa7d76991 [2022-04-07 21:20:19,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094009a17/da209ddd724c4941a44e834946847489 [2022-04-07 21:20:19,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:20:19,721 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:20:19,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:19,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:20:19,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:20:19,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78bc1abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19, skipping insertion in model container [2022-04-07 21:20:19,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:20:19,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:20:19,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c[5305,5318] [2022-04-07 21:20:19,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:19,884 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:20:19,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c[5305,5318] [2022-04-07 21:20:19,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:20:19,916 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:20:19,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19 WrapperNode [2022-04-07 21:20:19,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:20:19,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:20:19,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:20:19,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:20:19,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:20:19,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:20:19,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:20:19,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:20:19,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (1/1) ... [2022-04-07 21:20:19,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:20:19,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:20:19,967 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-04-07 21:20:19,971 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-04-07 21:20:19,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:20:19,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:20:19,993 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:20:19,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:20:19,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:20:20,047 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:20:20,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:20:20,339 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:20:20,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:20:20,344 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:20:20,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:20 BoogieIcfgContainer [2022-04-07 21:20:20,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:20:20,346 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:20:20,346 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:20:20,347 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:20:20,349 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:20" (1/1) ... [2022-04-07 21:20:20,351 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 21:20:20,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:20 BasicIcfg [2022-04-07 21:20:20,385 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:20:20,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:20:20,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:20:20,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:20:20,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:20:19" (1/4) ... [2022-04-07 21:20:20,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cabbfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:20, skipping insertion in model container [2022-04-07 21:20:20,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:20:19" (2/4) ... [2022-04-07 21:20:20,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cabbfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:20:20, skipping insertion in model container [2022-04-07 21:20:20,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:20:20" (3/4) ... [2022-04-07 21:20:20,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cabbfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:20, skipping insertion in model container [2022-04-07 21:20:20,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:20:20" (4/4) ... [2022-04-07 21:20:20,392 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.cJordan [2022-04-07 21:20:20,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:20:20,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:20:20,438 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:20:20,443 INFO L340 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 [2022-04-07 21:20:20,444 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:20:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 21:20:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 21:20:20,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:20,469 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:20,469 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash 267710119, now seen corresponding path program 1 times [2022-04-07 21:20:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:20,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454469008] [2022-04-07 21:20:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:20,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [273] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {60#true} is VALID [2022-04-07 21:20:20,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} [276] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-04-07 21:20:20,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} [370] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-04-07 21:20:20,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} [271] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:20,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [273] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {60#true} is VALID [2022-04-07 21:20:20,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} [276] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-04-07 21:20:20,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} [370] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-04-07 21:20:20,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} [272] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-04-07 21:20:20,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#true} [275] mainENTRY-->L211: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_3, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {60#true} is VALID [2022-04-07 21:20:20,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} [279] L211-->L55: Formula: (and (= |v_main_#t~nondet18_2| v_main_~cond~0_2) (<= |v_main_#t~nondet18_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648))) InVars {main_#t~nondet18=|v_main_#t~nondet18_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet18, main_~cond~0] {60#true} is VALID [2022-04-07 21:20:20,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#true} [282] L55-->L88: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk14~0_4 0) (= v_main_~lk7~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_5, main_~lk14~0=v_main_~lk14~0_4, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {60#true} is VALID [2022-04-07 21:20:20,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} [284] L88-->L88-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(= main_~lk1~0 1)} [286] L88-2-->L92-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(= main_~lk1~0 1)} [288] L92-1-->L96-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(= main_~lk1~0 1)} [290] L96-1-->L100-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(= main_~lk1~0 1)} [292] L100-1-->L104-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(= main_~lk1~0 1)} [294] L104-1-->L108-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(= main_~lk1~0 1)} [296] L108-1-->L112-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(= main_~lk1~0 1)} [298] L112-1-->L116-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(= main_~lk1~0 1)} [300] L116-1-->L120-1: Formula: (and (not (= v_main_~p9~0_3 0)) (= v_main_~lk9~0_4 1)) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_4, main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[main_~lk9~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(= main_~lk1~0 1)} [302] L120-1-->L124-1: Formula: (and (not (= v_main_~p10~0_2 0)) (= v_main_~lk10~0_3 1)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~lk10~0=v_main_~lk10~0_3, main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[main_~lk10~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(= main_~lk1~0 1)} [304] L124-1-->L128-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(= main_~lk1~0 1)} [306] L128-1-->L132-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(= main_~lk1~0 1)} [308] L132-1-->L136-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(= main_~lk1~0 1)} [310] L136-1-->L140-1: Formula: (and (not (= v_main_~p14~0_3 0)) (= v_main_~lk14~0_5 1)) InVars {main_~p14~0=v_main_~p14~0_3} OutVars{main_~p14~0=v_main_~p14~0_3, main_~lk14~0=v_main_~lk14~0_5} AuxVars[] AssignedVars[main_~lk14~0] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(= main_~lk1~0 1)} [312] L140-1-->L147: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {65#(= main_~lk1~0 1)} is VALID [2022-04-07 21:20:20,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {65#(= main_~lk1~0 1)} [314] L147-->L214: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {61#false} is VALID [2022-04-07 21:20:20,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} [318] L214-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61#false} is VALID [2022-04-07 21:20:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:20,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454469008] [2022-04-07 21:20:20,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454469008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:20,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:20,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911348973] [2022-04-07 21:20:20,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:20,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:20:20,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:20,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:20,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:20,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:20,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:20,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:20,791 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:21,160 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2022-04-07 21:20:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:21,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:20:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-07 21:20:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-07 21:20:21,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 193 transitions. [2022-04-07 21:20:21,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:21,343 INFO L225 Difference]: With dead ends: 105 [2022-04-07 21:20:21,344 INFO L226 Difference]: Without dead ends: 97 [2022-04-07 21:20:21,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:20:21,349 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 243 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:21,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 112 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:20:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-07 21:20:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2022-04-07 21:20:21,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:21,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,380 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,382 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:21,390 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-07 21:20:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-07 21:20:21,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:21,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:21,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-07 21:20:21,392 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-07 21:20:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:21,405 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-07 21:20:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-07 21:20:21,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:21,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:21,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:21,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-04-07 21:20:21,409 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2022-04-07 21:20:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:21,410 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-04-07 21:20:21,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-04-07 21:20:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 21:20:21,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:21,411 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:21,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:20:21,411 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash 267711173, now seen corresponding path program 1 times [2022-04-07 21:20:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:21,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646583037] [2022-04-07 21:20:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:21,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [273] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {438#true} is VALID [2022-04-07 21:20:21,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} [276] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-07 21:20:21,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {438#true} {438#true} [370] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-07 21:20:21,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {438#true} [271] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:21,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [273] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {438#true} is VALID [2022-04-07 21:20:21,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} [276] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-07 21:20:21,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {438#true} {438#true} [370] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-07 21:20:21,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#true} [272] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-07 21:20:21,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} [275] mainENTRY-->L211: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_3, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {438#true} is VALID [2022-04-07 21:20:21,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {438#true} [279] L211-->L55: Formula: (and (= |v_main_#t~nondet18_2| v_main_~cond~0_2) (<= |v_main_#t~nondet18_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648))) InVars {main_#t~nondet18=|v_main_#t~nondet18_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet18, main_~cond~0] {438#true} is VALID [2022-04-07 21:20:21,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#true} [282] L55-->L88: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk14~0_4 0) (= v_main_~lk7~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_5, main_~lk14~0=v_main_~lk14~0_4, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {438#true} is VALID [2022-04-07 21:20:21,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#true} [284] L88-->L88-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {443#(not (= main_~p1~0 0))} [286] L88-2-->L92-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {443#(not (= main_~p1~0 0))} [288] L92-1-->L96-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {443#(not (= main_~p1~0 0))} [290] L96-1-->L100-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(not (= main_~p1~0 0))} [292] L100-1-->L104-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {443#(not (= main_~p1~0 0))} [294] L104-1-->L108-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {443#(not (= main_~p1~0 0))} [296] L108-1-->L112-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {443#(not (= main_~p1~0 0))} [298] L112-1-->L116-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {443#(not (= main_~p1~0 0))} [300] L116-1-->L120-1: Formula: (and (not (= v_main_~p9~0_3 0)) (= v_main_~lk9~0_4 1)) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_4, main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[main_~lk9~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {443#(not (= main_~p1~0 0))} [302] L120-1-->L124-1: Formula: (and (not (= v_main_~p10~0_2 0)) (= v_main_~lk10~0_3 1)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~lk10~0=v_main_~lk10~0_3, main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[main_~lk10~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {443#(not (= main_~p1~0 0))} [304] L124-1-->L128-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {443#(not (= main_~p1~0 0))} [306] L128-1-->L132-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {443#(not (= main_~p1~0 0))} [308] L132-1-->L136-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {443#(not (= main_~p1~0 0))} [310] L136-1-->L140-1: Formula: (and (not (= v_main_~p14~0_3 0)) (= v_main_~lk14~0_5 1)) InVars {main_~p14~0=v_main_~p14~0_3} OutVars{main_~p14~0=v_main_~p14~0_3, main_~lk14~0=v_main_~lk14~0_5} AuxVars[] AssignedVars[main_~lk14~0] {443#(not (= main_~p1~0 0))} is VALID [2022-04-07 21:20:21,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {443#(not (= main_~p1~0 0))} [313] L140-1-->L146-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-07 21:20:21,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#false} [317] L146-1-->L214: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-07 21:20:21,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {439#false} [318] L214-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-07 21:20:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:21,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646583037] [2022-04-07 21:20:21,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646583037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:21,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:21,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651799565] [2022-04-07 21:20:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:21,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:20:21,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:21,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:21,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:21,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:21,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:21,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:21,501 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:21,728 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2022-04-07 21:20:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:21,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:20:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-07 21:20:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-07 21:20:21,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-07 21:20:21,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:21,873 INFO L225 Difference]: With dead ends: 98 [2022-04-07 21:20:21,873 INFO L226 Difference]: Without dead ends: 98 [2022-04-07 21:20:21,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:20:21,878 INFO L913 BasicCegarLoop]: 146 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:21,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 153 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:20:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-07 21:20:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-07 21:20:21,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:21,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,891 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,892 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:21,895 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2022-04-07 21:20:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 177 transitions. [2022-04-07 21:20:21,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:21,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:21,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-07 21:20:21,897 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-07 21:20:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:21,902 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2022-04-07 21:20:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 177 transitions. [2022-04-07 21:20:21,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:21,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:21,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:21,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.8804347826086956) internal successors, (173), 92 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 176 transitions. [2022-04-07 21:20:21,908 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 176 transitions. Word has length 25 [2022-04-07 21:20:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:21,908 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 176 transitions. [2022-04-07 21:20:21,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2022-04-07 21:20:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 21:20:21,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:21,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:21,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:20:21,909 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:21,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1621019816, now seen corresponding path program 1 times [2022-04-07 21:20:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:21,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731169297] [2022-04-07 21:20:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:21,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:21,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [273] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {840#true} is VALID [2022-04-07 21:20:21,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} [276] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {840#true} is VALID [2022-04-07 21:20:21,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} [370] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {840#true} is VALID [2022-04-07 21:20:21,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} [271] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:21,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [273] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {840#true} is VALID [2022-04-07 21:20:21,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} [276] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {840#true} is VALID [2022-04-07 21:20:21,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} [370] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {840#true} is VALID [2022-04-07 21:20:21,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} [272] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {840#true} is VALID [2022-04-07 21:20:21,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} [275] mainENTRY-->L211: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_3, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {840#true} is VALID [2022-04-07 21:20:21,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} [279] L211-->L55: Formula: (and (= |v_main_#t~nondet18_2| v_main_~cond~0_2) (<= |v_main_#t~nondet18_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648))) InVars {main_#t~nondet18=|v_main_#t~nondet18_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet18, main_~cond~0] {840#true} is VALID [2022-04-07 21:20:21,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} [282] L55-->L88: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk14~0_4 0) (= v_main_~lk7~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_5, main_~lk14~0=v_main_~lk14~0_4, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {840#true} is VALID [2022-04-07 21:20:21,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {840#true} [285] L88-->L88-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(= main_~p1~0 0)} [286] L88-2-->L92-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(= main_~p1~0 0)} [288] L92-1-->L96-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(= main_~p1~0 0)} [290] L96-1-->L100-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(= main_~p1~0 0)} [292] L100-1-->L104-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#(= main_~p1~0 0)} [294] L104-1-->L108-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#(= main_~p1~0 0)} [296] L108-1-->L112-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#(= main_~p1~0 0)} [298] L112-1-->L116-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#(= main_~p1~0 0)} [300] L116-1-->L120-1: Formula: (and (not (= v_main_~p9~0_3 0)) (= v_main_~lk9~0_4 1)) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_4, main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[main_~lk9~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {845#(= main_~p1~0 0)} [302] L120-1-->L124-1: Formula: (and (not (= v_main_~p10~0_2 0)) (= v_main_~lk10~0_3 1)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~lk10~0=v_main_~lk10~0_3, main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[main_~lk10~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#(= main_~p1~0 0)} [304] L124-1-->L128-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#(= main_~p1~0 0)} [306] L128-1-->L132-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#(= main_~p1~0 0)} [308] L132-1-->L136-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {845#(= main_~p1~0 0)} [310] L136-1-->L140-1: Formula: (and (not (= v_main_~p14~0_3 0)) (= v_main_~lk14~0_5 1)) InVars {main_~p14~0=v_main_~p14~0_3} OutVars{main_~p14~0=v_main_~p14~0_3, main_~lk14~0=v_main_~lk14~0_5} AuxVars[] AssignedVars[main_~lk14~0] {845#(= main_~p1~0 0)} is VALID [2022-04-07 21:20:21,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {845#(= main_~p1~0 0)} [312] L140-1-->L147: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {841#false} is VALID [2022-04-07 21:20:21,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {841#false} [314] L147-->L214: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {841#false} is VALID [2022-04-07 21:20:21,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {841#false} [318] L214-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {841#false} is VALID [2022-04-07 21:20:21,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-04-07 21:20:21,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:21,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731169297] [2022-04-07 21:20:21,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731169297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:21,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:21,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689558265] [2022-04-07 21:20:21,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:21,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:20:21,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:21,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:21,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:21,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:21,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:21,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:21,992 INFO L87 Difference]: Start difference. First operand 96 states and 176 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:22,223 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-07 21:20:22,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:22,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:20:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2022-04-07 21:20:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2022-04-07 21:20:22,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 176 transitions. [2022-04-07 21:20:22,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:22,365 INFO L225 Difference]: With dead ends: 100 [2022-04-07 21:20:22,365 INFO L226 Difference]: Without dead ends: 100 [2022-04-07 21:20:22,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:20:22,366 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:22,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 126 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:20:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-07 21:20:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-07 21:20:22,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:22,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,370 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,370 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:22,372 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-07 21:20:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-07 21:20:22,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:22,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:22,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-07 21:20:22,373 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-07 21:20:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:22,375 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-07 21:20:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-07 21:20:22,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:22,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:22,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:22,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2022-04-07 21:20:22,378 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 25 [2022-04-07 21:20:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:22,379 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2022-04-07 21:20:22,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2022-04-07 21:20:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 21:20:22,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:22,379 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:22,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:20:22,380 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:22,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1621020870, now seen corresponding path program 1 times [2022-04-07 21:20:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:22,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210961849] [2022-04-07 21:20:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:22,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:20:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:20:22,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {1256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [273] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1250#true} is VALID [2022-04-07 21:20:22,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {1250#true} [276] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1250#true} is VALID [2022-04-07 21:20:22,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1250#true} {1250#true} [370] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1250#true} is VALID [2022-04-07 21:20:22,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {1250#true} [271] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 21:20:22,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [273] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1250#true} is VALID [2022-04-07 21:20:22,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {1250#true} [276] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1250#true} is VALID [2022-04-07 21:20:22,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1250#true} {1250#true} [370] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1250#true} is VALID [2022-04-07 21:20:22,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {1250#true} [272] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1250#true} is VALID [2022-04-07 21:20:22,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {1250#true} [275] mainENTRY-->L211: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= |v_main_#t~nondet17_2| v_main_~p14~0_2) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet16_2| v_main_~p13~0_1) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet16=|v_main_#t~nondet16_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet17=|v_main_#t~nondet17_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p13~0=v_main_~p13~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~p14~0=v_main_~p14~0_2, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_2, main_~lk14~0=v_main_~lk14~0_3, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~p14~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~lk14~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_#t~nondet17, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1250#true} is VALID [2022-04-07 21:20:22,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {1250#true} [279] L211-->L55: Formula: (and (= |v_main_#t~nondet18_2| v_main_~cond~0_2) (<= |v_main_#t~nondet18_2| 2147483647) (<= 0 (+ |v_main_#t~nondet18_2| 2147483648))) InVars {main_#t~nondet18=|v_main_#t~nondet18_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet18, main_~cond~0] {1250#true} is VALID [2022-04-07 21:20:22,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {1250#true} [282] L55-->L88: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk14~0_4 0) (= v_main_~lk7~0_2 0) (= v_main_~lk3~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_5, main_~lk14~0=v_main_~lk14~0_4, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_2, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk13~0=v_main_~lk13~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk3~0, main_~lk14~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {1250#true} is VALID [2022-04-07 21:20:22,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {1250#true} [285] L88-->L88-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1250#true} is VALID [2022-04-07 21:20:22,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {1250#true} [286] L88-2-->L92-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {1255#(not (= main_~p2~0 0))} [288] L92-1-->L96-1: Formula: (and (= v_main_~lk3~0_6 1) (not (= v_main_~p3~0_4 0))) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4, main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[main_~lk3~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {1255#(not (= main_~p2~0 0))} [290] L96-1-->L100-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {1255#(not (= main_~p2~0 0))} [292] L100-1-->L104-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {1255#(not (= main_~p2~0 0))} [294] L104-1-->L108-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {1255#(not (= main_~p2~0 0))} [296] L108-1-->L112-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {1255#(not (= main_~p2~0 0))} [298] L112-1-->L116-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {1255#(not (= main_~p2~0 0))} [300] L116-1-->L120-1: Formula: (and (not (= v_main_~p9~0_3 0)) (= v_main_~lk9~0_4 1)) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_4, main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[main_~lk9~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {1255#(not (= main_~p2~0 0))} [302] L120-1-->L124-1: Formula: (and (not (= v_main_~p10~0_2 0)) (= v_main_~lk10~0_3 1)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~lk10~0=v_main_~lk10~0_3, main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[main_~lk10~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(not (= main_~p2~0 0))} [304] L124-1-->L128-1: Formula: (and (= v_main_~lk11~0_3 1) (not (= v_main_~p11~0_2 0))) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~lk11~0=v_main_~lk11~0_3, main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[main_~lk11~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {1255#(not (= main_~p2~0 0))} [306] L128-1-->L132-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {1255#(not (= main_~p2~0 0))} [308] L132-1-->L136-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {1255#(not (= main_~p2~0 0))} [310] L136-1-->L140-1: Formula: (and (not (= v_main_~p14~0_3 0)) (= v_main_~lk14~0_5 1)) InVars {main_~p14~0=v_main_~p14~0_3} OutVars{main_~p14~0=v_main_~p14~0_3, main_~lk14~0=v_main_~lk14~0_5} AuxVars[] AssignedVars[main_~lk14~0] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {1255#(not (= main_~p2~0 0))} [313] L140-1-->L146-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1255#(not (= main_~p2~0 0))} is VALID [2022-04-07 21:20:22,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {1255#(not (= main_~p2~0 0))} [317] L146-1-->L214: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {1251#false} is VALID [2022-04-07 21:20:22,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {1251#false} [318] L214-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1251#false} is VALID [2022-04-07 21:20:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 21:20:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:20:22,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210961849] [2022-04-07 21:20:22,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210961849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:20:22,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:20:22,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:20:22,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481336144] [2022-04-07 21:20:22,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:20:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:20:22,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:20:22,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:22,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:20:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:20:22,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:20:22,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:20:22,475 INFO L87 Difference]: Start difference. First operand 98 states and 176 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:22,590 INFO L93 Difference]: Finished difference Result 131 states and 232 transitions. [2022-04-07 21:20:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:20:22,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 21:20:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:20:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-04-07 21:20:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-04-07 21:20:22,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 128 transitions. [2022-04-07 21:20:22,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 21:20:22,684 INFO L225 Difference]: With dead ends: 131 [2022-04-07 21:20:22,684 INFO L226 Difference]: Without dead ends: 131 [2022-04-07 21:20:22,684 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:20:22,685 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 185 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 21:20:22,685 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 103 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 21:20:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-07 21:20:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-04-07 21:20:22,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:20:22,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 129 states, 125 states have (on average 1.824) internal successors, (228), 125 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,689 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 129 states, 125 states have (on average 1.824) internal successors, (228), 125 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,689 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 129 states, 125 states have (on average 1.824) internal successors, (228), 125 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:22,691 INFO L93 Difference]: Finished difference Result 131 states and 232 transitions. [2022-04-07 21:20:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 232 transitions. [2022-04-07 21:20:22,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:22,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:22,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 125 states have (on average 1.824) internal successors, (228), 125 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-07 21:20:22,692 INFO L87 Difference]: Start difference. First operand has 129 states, 125 states have (on average 1.824) internal successors, (228), 125 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-07 21:20:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:20:22,695 INFO L93 Difference]: Finished difference Result 131 states and 232 transitions. [2022-04-07 21:20:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 232 transitions. [2022-04-07 21:20:22,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:20:22,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:20:22,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:20:22,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:20:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 125 states have (on average 1.824) internal successors, (228), 125 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 231 transitions. [2022-04-07 21:20:22,698 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 231 transitions. Word has length 25 [2022-04-07 21:20:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:20:22,698 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 231 transitions. [2022-04-07 21:20:22,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 21:20:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 231 transitions. [2022-04-07 21:20:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 21:20:22,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:20:22,699 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:20:22,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 21:20:22,699 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:20:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:20:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1110486693, now seen corresponding path program 1 times [2022-04-07 21:20:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:20:22,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592845075] [2022-04-07 21:20:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:20:22,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:20:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 21:20:22,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 21:20:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 21:20:22,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 21:20:22,744 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 21:20:22,744 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 21:20:22,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 21:20:22,747 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-07 21:20:22,749 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 21:20:22,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:20:22 BasicIcfg [2022-04-07 21:20:22,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 21:20:22,774 INFO L158 Benchmark]: Toolchain (without parser) took 3052.52ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 137.4MB in the beginning and 134.0MB in the end (delta: 3.3MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. [2022-04-07 21:20:22,774 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory was 153.3MB in the beginning and 153.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 21:20:22,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.00ms. Allocated memory is still 187.7MB. Free memory was 137.2MB in the beginning and 162.1MB in the end (delta: -24.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 21:20:22,775 INFO L158 Benchmark]: Boogie Preprocessor took 26.73ms. Allocated memory is still 187.7MB. Free memory was 162.1MB in the beginning and 160.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:20:22,775 INFO L158 Benchmark]: RCFGBuilder took 400.90ms. Allocated memory is still 187.7MB. Free memory was 160.2MB in the beginning and 143.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-07 21:20:22,775 INFO L158 Benchmark]: IcfgTransformer took 39.25ms. Allocated memory is still 187.7MB. Free memory was 143.9MB in the beginning and 141.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:20:22,775 INFO L158 Benchmark]: TraceAbstraction took 2386.78ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 140.3MB in the beginning and 134.0MB in the end (delta: 6.3MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. [2022-04-07 21:20:22,776 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory was 153.3MB in the beginning and 153.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.00ms. Allocated memory is still 187.7MB. Free memory was 137.2MB in the beginning and 162.1MB in the end (delta: -24.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.73ms. Allocated memory is still 187.7MB. Free memory was 162.1MB in the beginning and 160.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 400.90ms. Allocated memory is still 187.7MB. Free memory was 160.2MB in the beginning and 143.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 39.25ms. Allocated memory is still 187.7MB. Free memory was 143.9MB in the beginning and 141.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2386.78ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 140.3MB in the beginning and 134.0MB in the end (delta: 6.3MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 219]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; VAL [p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L96] COND TRUE p3 != 0 [L97] lk3 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L128] COND TRUE p11 != 0 [L129] lk11 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] [L219] reach_error() VAL [cond=1, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=-1, p11=1, p12=1, p13=-2, p14=1, p2=0, p3=1, p4=1, p5=-3, p6=1, p7=1, p8=1, p9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 494 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 464 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 21:20:22,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...