/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 23:28:33,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 23:28:33,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 23:28:33,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 23:28:33,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 23:28:33,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 23:28:33,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 23:28:33,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 23:28:33,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 23:28:33,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 23:28:33,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 23:28:33,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 23:28:33,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 23:28:33,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 23:28:33,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 23:28:33,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 23:28:33,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 23:28:33,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 23:28:33,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 23:28:33,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 23:28:33,629 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 23:28:33,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 23:28:33,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 23:28:33,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 23:28:33,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 23:28:33,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 23:28:33,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 23:28:33,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 23:28:33,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 23:28:33,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 23:28:33,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 23:28:33,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 23:28:33,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 23:28:33,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 23:28:33,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 23:28:33,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 23:28:33,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 23:28:33,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 23:28:33,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 23:28:33,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 23:28:33,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 23:28:33,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 23:28:33,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 23:28:33,652 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 23:28:33,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 23:28:33,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 23:28:33,654 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 23:28:33,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 23:28:33,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 23:28:33,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 23:28:33,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 23:28:33,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 23:28:33,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 23:28:33,655 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 23:28:33,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 23:28:33,655 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 23:28:33,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 23:28:33,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 23:28:33,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 23:28:33,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 23:28:33,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 23:28:33,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:28:33,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 23:28:33,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 23:28:33,658 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 23:28:33,658 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-14 23:28:33,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 23:28:33,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 23:28:33,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 23:28:33,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 23:28:33,863 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 23:28:33,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-14 23:28:33,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3f0c41a/c3abef6dc663457e84b2578f69af08ba/FLAG8c81a34c6 [2022-04-14 23:28:34,232 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 23:28:34,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-14 23:28:34,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3f0c41a/c3abef6dc663457e84b2578f69af08ba/FLAG8c81a34c6 [2022-04-14 23:28:34,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3f0c41a/c3abef6dc663457e84b2578f69af08ba [2022-04-14 23:28:34,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 23:28:34,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 23:28:34,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 23:28:34,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 23:28:34,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 23:28:34,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ba7d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34, skipping insertion in model container [2022-04-14 23:28:34,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 23:28:34,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 23:28:34,886 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_6.c[2544,2557] [2022-04-14 23:28:34,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:28:34,916 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 23:28:34,932 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_6.c[2544,2557] [2022-04-14 23:28:34,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:28:34,943 INFO L208 MainTranslator]: Completed translation [2022-04-14 23:28:34,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34 WrapperNode [2022-04-14 23:28:34,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 23:28:34,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 23:28:34,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 23:28:34,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 23:28:34,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 23:28:34,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 23:28:34,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 23:28:34,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 23:28:34,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (1/1) ... [2022-04-14 23:28:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:28:35,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:28:35,014 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-14 23:28:35,040 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-14 23:28:35,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 23:28:35,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 23:28:35,057 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 23:28:35,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 23:28:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 23:28:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 23:28:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 23:28:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 23:28:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 23:28:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 23:28:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 23:28:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 23:28:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 23:28:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 23:28:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 23:28:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 23:28:35,109 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 23:28:35,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 23:28:35,260 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 23:28:35,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 23:28:35,266 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 23:28:35,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:28:35 BoogieIcfgContainer [2022-04-14 23:28:35,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 23:28:35,268 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 23:28:35,268 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 23:28:35,269 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 23:28:35,272 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:28:35" (1/1) ... [2022-04-14 23:28:35,273 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 23:28:35,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:28:35 BasicIcfg [2022-04-14 23:28:35,301 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 23:28:35,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 23:28:35,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 23:28:35,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 23:28:35,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:28:34" (1/4) ... [2022-04-14 23:28:35,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa26526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:28:35, skipping insertion in model container [2022-04-14 23:28:35,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:28:34" (2/4) ... [2022-04-14 23:28:35,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa26526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:28:35, skipping insertion in model container [2022-04-14 23:28:35,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:28:35" (3/4) ... [2022-04-14 23:28:35,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa26526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:28:35, skipping insertion in model container [2022-04-14 23:28:35,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:28:35" (4/4) ... [2022-04-14 23:28:35,307 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.cJordan [2022-04-14 23:28:35,311 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 23:28:35,311 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 23:28:35,344 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 23:28:35,351 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-14 23:28:35,351 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 23:28:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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-14 23:28:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 23:28:35,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:35,386 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:35,387 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1293324729, now seen corresponding path program 1 times [2022-04-14 23:28:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:35,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759698683] [2022-04-14 23:28:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:35,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {36#true} is VALID [2022-04-14 23:28:35,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-14 23:28:35,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-14 23:28:35,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:35,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {36#true} is VALID [2022-04-14 23:28:35,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-14 23:28:35,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-14 23:28:35,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-14 23:28:35,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {36#true} is VALID [2022-04-14 23:28:35,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {36#true} is VALID [2022-04-14 23:28:35,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {36#true} is VALID [2022-04-14 23:28:35,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} [148] L48-->L48-2: Formula: (and (not (= v_main_~p1~0_3 0)) (= v_main_~lk1~0_5 1)) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3, main_~lk1~0=v_main_~lk1~0_5} AuxVars[] AssignedVars[main_~lk1~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-14 23:28:35,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#(= main_~lk1~0 1)} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-14 23:28:35,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#(= main_~lk1~0 1)} [152] L52-1-->L56-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] {41#(= main_~lk1~0 1)} is VALID [2022-04-14 23:28:35,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(= main_~lk1~0 1)} [154] L56-1-->L60-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] {41#(= main_~lk1~0 1)} is VALID [2022-04-14 23:28:35,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(= main_~lk1~0 1)} [156] L60-1-->L64-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] {41#(= main_~lk1~0 1)} is VALID [2022-04-14 23:28:35,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#(= main_~lk1~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {41#(= main_~lk1~0 1)} is VALID [2022-04-14 23:28:35,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(= main_~lk1~0 1)} [160] L68-1-->L75: Formula: (not (= 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[] {41#(= main_~lk1~0 1)} is VALID [2022-04-14 23:28:35,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} [162] L75-->L100-1: Formula: (not (= v_main_~lk1~0_6 1)) InVars {main_~lk1~0=v_main_~lk1~0_6} OutVars{main_~lk1~0=v_main_~lk1~0_6} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-14 23:28:35,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-14 23:28:35,699 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-14 23:28:35,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:35,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759698683] [2022-04-14 23:28:35,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759698683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:35,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:35,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:35,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721601424] [2022-04-14 23:28:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:35,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-14 23:28:35,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:35,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:35,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:35,742 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:35,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:35,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:35,768 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,003 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2022-04-14 23:28:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:36,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-14 23:28:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-14 23:28:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-14 23:28:36,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-14 23:28:36,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:36,132 INFO L225 Difference]: With dead ends: 57 [2022-04-14 23:28:36,133 INFO L226 Difference]: Without dead ends: 49 [2022-04-14 23:28:36,134 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-14 23:28:36,137 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:36,137 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:28:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-14 23:28:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-14 23:28:36,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:36,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-14 23:28:36,163 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-14 23:28:36,163 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-14 23:28:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,168 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-14 23:28:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-14 23:28:36,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:36,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:36,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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 49 states. [2022-04-14 23:28:36,169 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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 49 states. [2022-04-14 23:28:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,173 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-14 23:28:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-14 23:28:36,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:36,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:36,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:36,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-14 23:28:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-14 23:28:36,177 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-14 23:28:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:36,177 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-14 23:28:36,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-14 23:28:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 23:28:36,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:36,179 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:36,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 23:28:36,179 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1194188104, now seen corresponding path program 1 times [2022-04-14 23:28:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:36,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695998432] [2022-04-14 23:28:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:36,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:36,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {238#true} is VALID [2022-04-14 23:28:36,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-14 23:28:36,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-14 23:28:36,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:36,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {238#true} is VALID [2022-04-14 23:28:36,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-14 23:28:36,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-14 23:28:36,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#true} is VALID [2022-04-14 23:28:36,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {238#true} is VALID [2022-04-14 23:28:36,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {238#true} is VALID [2022-04-14 23:28:36,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {238#true} is VALID [2022-04-14 23:28:36,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#true} [149] L48-->L48-2: Formula: (= 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[] {243#(= main_~p1~0 0)} is VALID [2022-04-14 23:28:36,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(= main_~p1~0 0)} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {243#(= main_~p1~0 0)} is VALID [2022-04-14 23:28:36,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(= main_~p1~0 0)} [152] L52-1-->L56-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] {243#(= main_~p1~0 0)} is VALID [2022-04-14 23:28:36,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#(= main_~p1~0 0)} [154] L56-1-->L60-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] {243#(= main_~p1~0 0)} is VALID [2022-04-14 23:28:36,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#(= main_~p1~0 0)} [156] L60-1-->L64-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] {243#(= main_~p1~0 0)} is VALID [2022-04-14 23:28:36,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(= main_~p1~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {243#(= main_~p1~0 0)} is VALID [2022-04-14 23:28:36,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#(= main_~p1~0 0)} [160] L68-1-->L75: Formula: (not (= 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[] {239#false} is VALID [2022-04-14 23:28:36,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#false} [162] L75-->L100-1: Formula: (not (= v_main_~lk1~0_6 1)) InVars {main_~lk1~0=v_main_~lk1~0_6} OutVars{main_~lk1~0=v_main_~lk1~0_6} AuxVars[] AssignedVars[] {239#false} is VALID [2022-04-14 23:28:36,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {239#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#false} is VALID [2022-04-14 23:28:36,242 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-14 23:28:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:36,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695998432] [2022-04-14 23:28:36,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695998432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:36,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:36,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433759749] [2022-04-14 23:28:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:36,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-14 23:28:36,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:36,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:36,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:36,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:36,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:36,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:36,260 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,380 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-14 23:28:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:36,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-14 23:28:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-14 23:28:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-14 23:28:36,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-04-14 23:28:36,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:36,464 INFO L225 Difference]: With dead ends: 49 [2022-04-14 23:28:36,465 INFO L226 Difference]: Without dead ends: 49 [2022-04-14 23:28:36,465 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-14 23:28:36,466 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:36,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-14 23:28:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-14 23:28:36,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:36,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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-14 23:28:36,471 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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-14 23:28:36,472 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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-14 23:28:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,474 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-14 23:28:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-14 23:28:36,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:36,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:36,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 49 states. [2022-04-14 23:28:36,476 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 49 states. [2022-04-14 23:28:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,478 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-14 23:28:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-14 23:28:36,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:36,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:36,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:36,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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-14 23:28:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-14 23:28:36,481 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-14 23:28:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:36,482 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-14 23:28:36,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-14 23:28:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-14 23:28:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 23:28:36,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:36,483 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:36,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 23:28:36,483 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1438328994, now seen corresponding path program 1 times [2022-04-14 23:28:36,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:36,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683342410] [2022-04-14 23:28:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:36,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:36,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {444#true} is VALID [2022-04-14 23:28:36,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-14 23:28:36,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {444#true} {444#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-14 23:28:36,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {444#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:36,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {444#true} is VALID [2022-04-14 23:28:36,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-14 23:28:36,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {444#true} {444#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-14 23:28:36,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {444#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-14 23:28:36,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {444#true} is VALID [2022-04-14 23:28:36,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {444#true} is VALID [2022-04-14 23:28:36,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {444#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {444#true} is VALID [2022-04-14 23:28:36,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#true} [148] L48-->L48-2: Formula: (and (not (= v_main_~p1~0_3 0)) (= v_main_~lk1~0_5 1)) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3, main_~lk1~0=v_main_~lk1~0_5} AuxVars[] AssignedVars[main_~lk1~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:28:36,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {449#(not (= main_~p1~0 0))} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:28:36,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {449#(not (= main_~p1~0 0))} [152] L52-1-->L56-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] {449#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:28:36,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {449#(not (= main_~p1~0 0))} [154] L56-1-->L60-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] {449#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:28:36,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {449#(not (= main_~p1~0 0))} [156] L60-1-->L64-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] {449#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:28:36,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#(not (= main_~p1~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {449#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:28:36,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {449#(not (= main_~p1~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-14 23:28:36,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#false} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-14 23:28:36,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#false} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-14 23:28:36,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {445#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-14 23:28:36,563 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-14 23:28:36,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:36,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683342410] [2022-04-14 23:28:36,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683342410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:36,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:36,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556482857] [2022-04-14 23:28:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:36,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-14 23:28:36,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:36,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:36,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:36,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:36,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:36,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:36,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:36,579 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,700 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-14 23:28:36,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:36,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-14 23:28:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-04-14 23:28:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-04-14 23:28:36,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2022-04-14 23:28:36,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:36,778 INFO L225 Difference]: With dead ends: 52 [2022-04-14 23:28:36,778 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 23:28:36,779 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-14 23:28:36,784 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:36,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 23:28:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-14 23:28:36,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:36,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-14 23:28:36,797 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-14 23:28:36,797 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-14 23:28:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,804 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-14 23:28:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-14 23:28:36,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:36,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:36,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 52 states. [2022-04-14 23:28:36,807 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 52 states. [2022-04-14 23:28:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:36,811 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-14 23:28:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-14 23:28:36,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:36,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:36,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:36,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-14 23:28:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-14 23:28:36,817 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-14 23:28:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:36,817 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-14 23:28:36,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-14 23:28:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 23:28:36,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:36,820 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:36,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 23:28:36,820 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1634842499, now seen corresponding path program 1 times [2022-04-14 23:28:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:36,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939376497] [2022-04-14 23:28:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:36,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {662#true} is VALID [2022-04-14 23:28:36,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {662#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-14 23:28:36,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {662#true} {662#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-14 23:28:36,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {662#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:36,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {662#true} is VALID [2022-04-14 23:28:36,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {662#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-14 23:28:36,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {662#true} {662#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-14 23:28:36,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {662#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#true} is VALID [2022-04-14 23:28:36,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {662#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {662#true} is VALID [2022-04-14 23:28:36,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {662#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {662#true} is VALID [2022-04-14 23:28:36,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {662#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {662#true} is VALID [2022-04-14 23:28:36,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {662#true} [149] L48-->L48-2: Formula: (= 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[] {662#true} is VALID [2022-04-14 23:28:36,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {662#true} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {667#(= main_~lk2~0 1)} is VALID [2022-04-14 23:28:36,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {667#(= main_~lk2~0 1)} [152] L52-1-->L56-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] {667#(= main_~lk2~0 1)} is VALID [2022-04-14 23:28:36,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {667#(= main_~lk2~0 1)} [154] L56-1-->L60-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] {667#(= main_~lk2~0 1)} is VALID [2022-04-14 23:28:36,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(= main_~lk2~0 1)} [156] L60-1-->L64-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] {667#(= main_~lk2~0 1)} is VALID [2022-04-14 23:28:36,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {667#(= main_~lk2~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {667#(= main_~lk2~0 1)} is VALID [2022-04-14 23:28:36,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {667#(= main_~lk2~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {667#(= main_~lk2~0 1)} is VALID [2022-04-14 23:28:36,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {667#(= main_~lk2~0 1)} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {667#(= main_~lk2~0 1)} is VALID [2022-04-14 23:28:36,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {667#(= main_~lk2~0 1)} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {663#false} is VALID [2022-04-14 23:28:36,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {663#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#false} is VALID [2022-04-14 23:28:36,904 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-14 23:28:36,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:36,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939376497] [2022-04-14 23:28:36,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939376497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:36,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:36,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058692065] [2022-04-14 23:28:36,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:36,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-14 23:28:36,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:36,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:36,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:36,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:36,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:36,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:36,920 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,033 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2022-04-14 23:28:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:37,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-14 23:28:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 23:28:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 23:28:37,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-14 23:28:37,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:37,100 INFO L225 Difference]: With dead ends: 87 [2022-04-14 23:28:37,100 INFO L226 Difference]: Without dead ends: 87 [2022-04-14 23:28:37,101 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-14 23:28:37,109 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 93 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:37,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 53 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-14 23:28:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2022-04-14 23:28:37,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:37,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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-14 23:28:37,118 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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-14 23:28:37,118 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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-14 23:28:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,121 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2022-04-14 23:28:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 142 transitions. [2022-04-14 23:28:37,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:37,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:37,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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 87 states. [2022-04-14 23:28:37,125 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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 87 states. [2022-04-14 23:28:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,128 INFO L93 Difference]: Finished difference Result 87 states and 142 transitions. [2022-04-14 23:28:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 142 transitions. [2022-04-14 23:28:37,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:37,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:37,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:37,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 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-14 23:28:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 105 transitions. [2022-04-14 23:28:37,131 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 105 transitions. Word has length 18 [2022-04-14 23:28:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:37,131 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 105 transitions. [2022-04-14 23:28:37,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 105 transitions. [2022-04-14 23:28:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 23:28:37,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:37,132 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:37,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 23:28:37,132 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:37,133 INFO L85 PathProgramCache]: Analyzing trace with hash 852670334, now seen corresponding path program 1 times [2022-04-14 23:28:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:37,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386177703] [2022-04-14 23:28:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:37,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {1000#true} is VALID [2022-04-14 23:28:37,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-14 23:28:37,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1000#true} {1000#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-14 23:28:37,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:37,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {1000#true} is VALID [2022-04-14 23:28:37,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-14 23:28:37,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-14 23:28:37,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-14 23:28:37,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {1000#true} is VALID [2022-04-14 23:28:37,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {1000#true} is VALID [2022-04-14 23:28:37,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {1000#true} is VALID [2022-04-14 23:28:37,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#true} [149] L48-->L48-2: Formula: (= 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[] {1000#true} is VALID [2022-04-14 23:28:37,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} [151] L48-2-->L52-1: 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[] {1005#(= main_~p2~0 0)} is VALID [2022-04-14 23:28:37,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {1005#(= main_~p2~0 0)} [152] L52-1-->L56-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] {1005#(= main_~p2~0 0)} is VALID [2022-04-14 23:28:37,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {1005#(= main_~p2~0 0)} [154] L56-1-->L60-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] {1005#(= main_~p2~0 0)} is VALID [2022-04-14 23:28:37,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {1005#(= main_~p2~0 0)} [156] L60-1-->L64-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] {1005#(= main_~p2~0 0)} is VALID [2022-04-14 23:28:37,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {1005#(= main_~p2~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1005#(= main_~p2~0 0)} is VALID [2022-04-14 23:28:37,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#(= main_~p2~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {1005#(= main_~p2~0 0)} is VALID [2022-04-14 23:28:37,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {1005#(= main_~p2~0 0)} [164] L74-1-->L80: Formula: (not (= v_main_~p2~0_2 0)) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-14 23:28:37,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {1001#false} [168] L80-->L100-1: Formula: (not (= v_main_~lk2~0_2 1)) InVars {main_~lk2~0=v_main_~lk2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_2} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-14 23:28:37,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {1001#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-14 23:28:37,193 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-14 23:28:37,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:37,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386177703] [2022-04-14 23:28:37,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386177703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:37,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:37,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312231740] [2022-04-14 23:28:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:37,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-14 23:28:37,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:37,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:37,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:37,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:37,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:37,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:37,208 INFO L87 Difference]: Start difference. First operand 65 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,322 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2022-04-14 23:28:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:37,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-14 23:28:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-14 23:28:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-14 23:28:37,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-14 23:28:37,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:37,399 INFO L225 Difference]: With dead ends: 89 [2022-04-14 23:28:37,399 INFO L226 Difference]: Without dead ends: 89 [2022-04-14 23:28:37,400 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-14 23:28:37,400 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:37,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 65 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-14 23:28:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-14 23:28:37,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:37,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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-14 23:28:37,405 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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-14 23:28:37,405 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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-14 23:28:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,408 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2022-04-14 23:28:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2022-04-14 23:28:37,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:37,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:37,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 89 states. [2022-04-14 23:28:37,409 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 89 states. [2022-04-14 23:28:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,412 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2022-04-14 23:28:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2022-04-14 23:28:37,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:37,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:37,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:37,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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-14 23:28:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-14 23:28:37,415 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-14 23:28:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:37,415 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-14 23:28:37,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-14 23:28:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-14 23:28:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 23:28:37,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:37,416 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:37,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 23:28:37,416 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 859522148, now seen corresponding path program 1 times [2022-04-14 23:28:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:37,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630860871] [2022-04-14 23:28:37,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:37,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {1372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {1366#true} is VALID [2022-04-14 23:28:37,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-14 23:28:37,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-14 23:28:37,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:37,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {1372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {1366#true} is VALID [2022-04-14 23:28:37,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-14 23:28:37,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-14 23:28:37,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1366#true} is VALID [2022-04-14 23:28:37,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {1366#true} is VALID [2022-04-14 23:28:37,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {1366#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {1366#true} is VALID [2022-04-14 23:28:37,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {1366#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {1366#true} is VALID [2022-04-14 23:28:37,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {1366#true} [149] L48-->L48-2: Formula: (= 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[] {1366#true} is VALID [2022-04-14 23:28:37,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1366#true} [150] L48-2-->L52-1: Formula: (and (= v_main_~lk2~0_6 1) (not (= v_main_~p2~0_4 0))) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_6, main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[main_~lk2~0] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:28:37,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {1371#(not (= main_~p2~0 0))} [152] L52-1-->L56-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] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:28:37,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {1371#(not (= main_~p2~0 0))} [154] L56-1-->L60-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] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:28:37,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {1371#(not (= main_~p2~0 0))} [156] L60-1-->L64-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] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:28:37,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {1371#(not (= main_~p2~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:28:37,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {1371#(not (= main_~p2~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {1371#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:28:37,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#(not (= main_~p2~0 0))} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-14 23:28:37,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#false} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-14 23:28:37,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#false} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-14 23:28:37,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1367#false} is VALID [2022-04-14 23:28:37,458 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-14 23:28:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:37,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630860871] [2022-04-14 23:28:37,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630860871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:37,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:37,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386344282] [2022-04-14 23:28:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-14 23:28:37,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:37,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:37,472 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:37,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:37,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:37,472 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,584 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2022-04-14 23:28:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:37,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-14 23:28:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 23:28:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 23:28:37,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-14 23:28:37,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:37,671 INFO L225 Difference]: With dead ends: 91 [2022-04-14 23:28:37,671 INFO L226 Difference]: Without dead ends: 91 [2022-04-14 23:28:37,671 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-14 23:28:37,672 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:37,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 70 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-14 23:28:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-14 23:28:37,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:37,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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-14 23:28:37,676 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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-14 23:28:37,676 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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-14 23:28:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,679 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2022-04-14 23:28:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2022-04-14 23:28:37,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:37,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:37,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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 91 states. [2022-04-14 23:28:37,680 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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 91 states. [2022-04-14 23:28:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,682 INFO L93 Difference]: Finished difference Result 91 states and 140 transitions. [2022-04-14 23:28:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2022-04-14 23:28:37,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:37,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:37,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:37,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 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-14 23:28:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2022-04-14 23:28:37,685 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 19 [2022-04-14 23:28:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:37,686 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2022-04-14 23:28:37,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2022-04-14 23:28:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 23:28:37,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:37,686 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:37,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 23:28:37,687 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash 663008643, now seen corresponding path program 1 times [2022-04-14 23:28:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:37,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201654112] [2022-04-14 23:28:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:37,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {1740#true} is VALID [2022-04-14 23:28:37,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-14 23:28:37,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1740#true} {1740#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-14 23:28:37,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {1740#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:37,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {1740#true} is VALID [2022-04-14 23:28:37,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {1740#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-14 23:28:37,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1740#true} {1740#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-14 23:28:37,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {1740#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1740#true} is VALID [2022-04-14 23:28:37,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {1740#true} is VALID [2022-04-14 23:28:37,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {1740#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {1740#true} is VALID [2022-04-14 23:28:37,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1740#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {1740#true} is VALID [2022-04-14 23:28:37,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {1740#true} [149] L48-->L48-2: Formula: (= 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[] {1740#true} is VALID [2022-04-14 23:28:37,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1740#true} [151] L48-2-->L52-1: 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[] {1740#true} is VALID [2022-04-14 23:28:37,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {1740#true} [152] L52-1-->L56-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] {1745#(= main_~lk3~0 1)} is VALID [2022-04-14 23:28:37,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {1745#(= main_~lk3~0 1)} [154] L56-1-->L60-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] {1745#(= main_~lk3~0 1)} is VALID [2022-04-14 23:28:37,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {1745#(= main_~lk3~0 1)} [156] L60-1-->L64-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] {1745#(= main_~lk3~0 1)} is VALID [2022-04-14 23:28:37,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1745#(= main_~lk3~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {1745#(= main_~lk3~0 1)} is VALID [2022-04-14 23:28:37,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {1745#(= main_~lk3~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {1745#(= main_~lk3~0 1)} is VALID [2022-04-14 23:28:37,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {1745#(= main_~lk3~0 1)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1745#(= main_~lk3~0 1)} is VALID [2022-04-14 23:28:37,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {1745#(= main_~lk3~0 1)} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {1745#(= main_~lk3~0 1)} is VALID [2022-04-14 23:28:37,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {1745#(= main_~lk3~0 1)} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {1741#false} is VALID [2022-04-14 23:28:37,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {1741#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1741#false} is VALID [2022-04-14 23:28:37,727 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-14 23:28:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:37,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201654112] [2022-04-14 23:28:37,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201654112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:37,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:37,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:37,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356351983] [2022-04-14 23:28:37,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:37,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-14 23:28:37,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:37,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:37,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:37,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:37,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:37,741 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,846 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2022-04-14 23:28:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:37,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-14 23:28:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-14 23:28:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-14 23:28:37,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2022-04-14 23:28:37,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:37,913 INFO L225 Difference]: With dead ends: 155 [2022-04-14 23:28:37,913 INFO L226 Difference]: Without dead ends: 155 [2022-04-14 23:28:37,914 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-14 23:28:37,915 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:37,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-14 23:28:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2022-04-14 23:28:37,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:37,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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-14 23:28:37,930 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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-14 23:28:37,930 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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-14 23:28:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,934 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2022-04-14 23:28:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2022-04-14 23:28:37,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:37,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:37,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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 155 states. [2022-04-14 23:28:37,935 INFO L87 Difference]: Start difference. First operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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 155 states. [2022-04-14 23:28:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:37,939 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2022-04-14 23:28:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2022-04-14 23:28:37,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:37,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:37,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:37,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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-14 23:28:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2022-04-14 23:28:37,942 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 19 [2022-04-14 23:28:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:37,942 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2022-04-14 23:28:37,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2022-04-14 23:28:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 23:28:37,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:37,943 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:37,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 23:28:37,943 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1144445820, now seen corresponding path program 1 times [2022-04-14 23:28:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:37,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817122509] [2022-04-14 23:28:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:37,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {2344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {2338#true} is VALID [2022-04-14 23:28:37,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-14 23:28:37,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2338#true} {2338#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-14 23:28:37,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:38,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {2344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {2338#true} is VALID [2022-04-14 23:28:38,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {2338#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-14 23:28:38,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2338#true} {2338#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-14 23:28:38,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {2338#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#true} is VALID [2022-04-14 23:28:38,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {2338#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {2338#true} is VALID [2022-04-14 23:28:38,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {2338#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {2338#true} is VALID [2022-04-14 23:28:38,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {2338#true} is VALID [2022-04-14 23:28:38,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} [149] L48-->L48-2: Formula: (= 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[] {2338#true} is VALID [2022-04-14 23:28:38,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} [151] L48-2-->L52-1: 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[] {2338#true} is VALID [2022-04-14 23:28:38,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {2338#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {2343#(= main_~p3~0 0)} is VALID [2022-04-14 23:28:38,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {2343#(= main_~p3~0 0)} [154] L56-1-->L60-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] {2343#(= main_~p3~0 0)} is VALID [2022-04-14 23:28:38,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {2343#(= main_~p3~0 0)} [156] L60-1-->L64-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] {2343#(= main_~p3~0 0)} is VALID [2022-04-14 23:28:38,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {2343#(= main_~p3~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {2343#(= main_~p3~0 0)} is VALID [2022-04-14 23:28:38,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {2343#(= main_~p3~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {2343#(= main_~p3~0 0)} is VALID [2022-04-14 23:28:38,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {2343#(= main_~p3~0 0)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {2343#(= main_~p3~0 0)} is VALID [2022-04-14 23:28:38,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {2343#(= main_~p3~0 0)} [170] L79-1-->L85: Formula: (not (= v_main_~p3~0_2 0)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2} AuxVars[] AssignedVars[] {2339#false} is VALID [2022-04-14 23:28:38,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {2339#false} [172] L85-->L100-1: Formula: (not (= v_main_~lk3~0_3 1)) InVars {main_~lk3~0=v_main_~lk3~0_3} OutVars{main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[] {2339#false} is VALID [2022-04-14 23:28:38,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {2339#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2339#false} is VALID [2022-04-14 23:28:38,006 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-14 23:28:38,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:38,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817122509] [2022-04-14 23:28:38,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817122509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:38,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:38,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:38,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770813963] [2022-04-14 23:28:38,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-14 23:28:38,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:38,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:38,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:38,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:38,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:38,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:38,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:38,021 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,123 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2022-04-14 23:28:38,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:38,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-04-14 23:28:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-14 23:28:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-14 23:28:38,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2022-04-14 23:28:38,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:38,198 INFO L225 Difference]: With dead ends: 163 [2022-04-14 23:28:38,198 INFO L226 Difference]: Without dead ends: 163 [2022-04-14 23:28:38,198 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-14 23:28:38,199 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 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-14 23:28:38,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-14 23:28:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-04-14 23:28:38,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:38,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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-14 23:28:38,213 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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-14 23:28:38,214 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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-14 23:28:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,221 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2022-04-14 23:28:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2022-04-14 23:28:38,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:38,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:38,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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 163 states. [2022-04-14 23:28:38,222 INFO L87 Difference]: Start difference. First operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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 163 states. [2022-04-14 23:28:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,226 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2022-04-14 23:28:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2022-04-14 23:28:38,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:38,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:38,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:38,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 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-14 23:28:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 243 transitions. [2022-04-14 23:28:38,231 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 243 transitions. Word has length 19 [2022-04-14 23:28:38,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:38,231 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 243 transitions. [2022-04-14 23:28:38,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:28:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 243 transitions. [2022-04-14 23:28:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 23:28:38,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:38,232 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] [2022-04-14 23:28:38,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 23:28:38,233 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash -921536358, now seen corresponding path program 1 times [2022-04-14 23:28:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:38,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700754448] [2022-04-14 23:28:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:38,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:38,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {3006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {3000#true} is VALID [2022-04-14 23:28:38,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {3000#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-14 23:28:38,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3000#true} {3000#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-14 23:28:38,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {3000#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:38,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {3006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {3000#true} is VALID [2022-04-14 23:28:38,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {3000#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-14 23:28:38,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3000#true} {3000#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-14 23:28:38,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {3000#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3000#true} is VALID [2022-04-14 23:28:38,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {3000#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {3000#true} is VALID [2022-04-14 23:28:38,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {3000#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {3000#true} is VALID [2022-04-14 23:28:38,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {3000#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {3000#true} is VALID [2022-04-14 23:28:38,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {3000#true} [149] L48-->L48-2: Formula: (= 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[] {3000#true} is VALID [2022-04-14 23:28:38,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {3000#true} [151] L48-2-->L52-1: 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[] {3000#true} is VALID [2022-04-14 23:28:38,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {3000#true} [152] L52-1-->L56-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] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:28:38,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {3005#(not (= main_~p3~0 0))} [154] L56-1-->L60-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] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:28:38,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {3005#(not (= main_~p3~0 0))} [156] L60-1-->L64-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] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:28:38,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {3005#(not (= main_~p3~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:28:38,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {3005#(not (= main_~p3~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:28:38,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {3005#(not (= main_~p3~0 0))} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3005#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:28:38,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {3005#(not (= main_~p3~0 0))} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3001#false} is VALID [2022-04-14 23:28:38,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {3001#false} [174] L84-1-->L90: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {3001#false} is VALID [2022-04-14 23:28:38,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {3001#false} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {3001#false} is VALID [2022-04-14 23:28:38,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {3001#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3001#false} is VALID [2022-04-14 23:28:38,297 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-14 23:28:38,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:38,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700754448] [2022-04-14 23:28:38,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700754448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:38,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:38,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:38,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939147174] [2022-04-14 23:28:38,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:38,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-14 23:28:38,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:38,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:38,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:38,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:38,311 INFO L87 Difference]: Start difference. First operand 161 states and 243 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,419 INFO L93 Difference]: Finished difference Result 167 states and 244 transitions. [2022-04-14 23:28:38,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:38,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-14 23:28:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-14 23:28:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-14 23:28:38,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-04-14 23:28:38,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:38,483 INFO L225 Difference]: With dead ends: 167 [2022-04-14 23:28:38,483 INFO L226 Difference]: Without dead ends: 167 [2022-04-14 23:28:38,483 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-14 23:28:38,483 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:38,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-14 23:28:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-14 23:28:38,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:38,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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-14 23:28:38,487 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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-14 23:28:38,488 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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-14 23:28:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,491 INFO L93 Difference]: Finished difference Result 167 states and 244 transitions. [2022-04-14 23:28:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2022-04-14 23:28:38,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:38,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:38,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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 167 states. [2022-04-14 23:28:38,493 INFO L87 Difference]: Start difference. First operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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 167 states. [2022-04-14 23:28:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,496 INFO L93 Difference]: Finished difference Result 167 states and 244 transitions. [2022-04-14 23:28:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2022-04-14 23:28:38,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:38,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:38,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:38,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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-14 23:28:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2022-04-14 23:28:38,500 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 20 [2022-04-14 23:28:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:38,500 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2022-04-14 23:28:38,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2022-04-14 23:28:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 23:28:38,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:38,501 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] [2022-04-14 23:28:38,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 23:28:38,501 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1118049863, now seen corresponding path program 1 times [2022-04-14 23:28:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:38,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097189745] [2022-04-14 23:28:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:38,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {3678#true} is VALID [2022-04-14 23:28:38,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {3678#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-14 23:28:38,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3678#true} {3678#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-14 23:28:38,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {3678#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:38,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {3678#true} is VALID [2022-04-14 23:28:38,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {3678#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-14 23:28:38,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3678#true} {3678#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-14 23:28:38,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {3678#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-14 23:28:38,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {3678#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {3678#true} is VALID [2022-04-14 23:28:38,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {3678#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {3678#true} is VALID [2022-04-14 23:28:38,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {3678#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {3678#true} is VALID [2022-04-14 23:28:38,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {3678#true} [149] L48-->L48-2: Formula: (= 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[] {3678#true} is VALID [2022-04-14 23:28:38,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {3678#true} [151] L48-2-->L52-1: 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[] {3678#true} is VALID [2022-04-14 23:28:38,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {3678#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {3678#true} is VALID [2022-04-14 23:28:38,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {3678#true} [154] L56-1-->L60-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] {3683#(= main_~lk4~0 1)} is VALID [2022-04-14 23:28:38,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {3683#(= main_~lk4~0 1)} [156] L60-1-->L64-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] {3683#(= main_~lk4~0 1)} is VALID [2022-04-14 23:28:38,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {3683#(= main_~lk4~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {3683#(= main_~lk4~0 1)} is VALID [2022-04-14 23:28:38,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {3683#(= main_~lk4~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {3683#(= main_~lk4~0 1)} is VALID [2022-04-14 23:28:38,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {3683#(= main_~lk4~0 1)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3683#(= main_~lk4~0 1)} is VALID [2022-04-14 23:28:38,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {3683#(= main_~lk4~0 1)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3683#(= main_~lk4~0 1)} is VALID [2022-04-14 23:28:38,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {3683#(= main_~lk4~0 1)} [174] L84-1-->L90: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {3683#(= main_~lk4~0 1)} is VALID [2022-04-14 23:28:38,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {3683#(= main_~lk4~0 1)} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {3679#false} is VALID [2022-04-14 23:28:38,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {3679#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3679#false} is VALID [2022-04-14 23:28:38,536 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-14 23:28:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:38,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097189745] [2022-04-14 23:28:38,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097189745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:38,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:38,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925286953] [2022-04-14 23:28:38,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-14 23:28:38,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:38,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:38,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:38,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:38,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:38,550 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,653 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2022-04-14 23:28:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:38,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-14 23:28:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-14 23:28:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-14 23:28:38,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-14 23:28:38,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:38,714 INFO L225 Difference]: With dead ends: 283 [2022-04-14 23:28:38,714 INFO L226 Difference]: Without dead ends: 283 [2022-04-14 23:28:38,714 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-14 23:28:38,715 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:38,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-14 23:28:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-14 23:28:38,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:38,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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-14 23:28:38,720 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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-14 23:28:38,720 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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-14 23:28:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,726 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2022-04-14 23:28:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2022-04-14 23:28:38,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:38,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:38,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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 283 states. [2022-04-14 23:28:38,727 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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 283 states. [2022-04-14 23:28:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,733 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2022-04-14 23:28:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2022-04-14 23:28:38,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:38,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:38,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:38,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 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-14 23:28:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 335 transitions. [2022-04-14 23:28:38,738 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 335 transitions. Word has length 20 [2022-04-14 23:28:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:38,738 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 335 transitions. [2022-04-14 23:28:38,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 335 transitions. [2022-04-14 23:28:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 23:28:38,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:38,739 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] [2022-04-14 23:28:38,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 23:28:38,740 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1369462970, now seen corresponding path program 1 times [2022-04-14 23:28:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:38,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316643554] [2022-04-14 23:28:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:38,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:38,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:38,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {4778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {4772#true} is VALID [2022-04-14 23:28:38,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {4772#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-14 23:28:38,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4772#true} {4772#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-14 23:28:38,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {4772#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:38,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {4778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {4772#true} is VALID [2022-04-14 23:28:38,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {4772#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-14 23:28:38,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4772#true} {4772#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-14 23:28:38,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {4772#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-14 23:28:38,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {4772#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {4772#true} is VALID [2022-04-14 23:28:38,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {4772#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {4772#true} is VALID [2022-04-14 23:28:38,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {4772#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {4772#true} is VALID [2022-04-14 23:28:38,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {4772#true} [149] L48-->L48-2: Formula: (= 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[] {4772#true} is VALID [2022-04-14 23:28:38,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {4772#true} [151] L48-2-->L52-1: 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[] {4772#true} is VALID [2022-04-14 23:28:38,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {4772#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {4772#true} is VALID [2022-04-14 23:28:38,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {4772#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {4777#(= main_~p4~0 0)} is VALID [2022-04-14 23:28:38,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {4777#(= main_~p4~0 0)} [156] L60-1-->L64-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] {4777#(= main_~p4~0 0)} is VALID [2022-04-14 23:28:38,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {4777#(= main_~p4~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {4777#(= main_~p4~0 0)} is VALID [2022-04-14 23:28:38,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {4777#(= main_~p4~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {4777#(= main_~p4~0 0)} is VALID [2022-04-14 23:28:38,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {4777#(= main_~p4~0 0)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {4777#(= main_~p4~0 0)} is VALID [2022-04-14 23:28:38,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {4777#(= main_~p4~0 0)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {4777#(= main_~p4~0 0)} is VALID [2022-04-14 23:28:38,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {4777#(= main_~p4~0 0)} [174] L84-1-->L90: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {4773#false} is VALID [2022-04-14 23:28:38,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {4773#false} [176] L90-->L100-1: Formula: (not (= v_main_~lk4~0_3 1)) InVars {main_~lk4~0=v_main_~lk4~0_3} OutVars{main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[] {4773#false} is VALID [2022-04-14 23:28:38,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {4773#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4773#false} is VALID [2022-04-14 23:28:38,798 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-14 23:28:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:38,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316643554] [2022-04-14 23:28:38,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316643554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:38,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:38,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015142571] [2022-04-14 23:28:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-14 23:28:38,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:38,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:38,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:38,815 INFO L87 Difference]: Start difference. First operand 233 states and 335 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:38,948 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2022-04-14 23:28:38,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:38,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-14 23:28:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-14 23:28:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-14 23:28:38,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-14 23:28:39,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:39,014 INFO L225 Difference]: With dead ends: 307 [2022-04-14 23:28:39,014 INFO L226 Difference]: Without dead ends: 307 [2022-04-14 23:28:39,015 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-14 23:28:39,015 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:39,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-14 23:28:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-14 23:28:39,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:39,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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-14 23:28:39,021 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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-14 23:28:39,022 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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-14 23:28:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,028 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2022-04-14 23:28:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2022-04-14 23:28:39,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:39,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:39,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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 307 states. [2022-04-14 23:28:39,030 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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 307 states. [2022-04-14 23:28:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,036 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2022-04-14 23:28:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2022-04-14 23:28:39,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:39,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:39,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:39,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 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-14 23:28:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 423 transitions. [2022-04-14 23:28:39,053 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 423 transitions. Word has length 20 [2022-04-14 23:28:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:39,054 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 423 transitions. [2022-04-14 23:28:39,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-14 23:28:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 423 transitions. [2022-04-14 23:28:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 23:28:39,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:39,055 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] [2022-04-14 23:28:39,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 23:28:39,055 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:39,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:39,055 INFO L85 PathProgramCache]: Analyzing trace with hash -299775072, now seen corresponding path program 1 times [2022-04-14 23:28:39,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:39,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394450467] [2022-04-14 23:28:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:39,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {6016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {6010#true} is VALID [2022-04-14 23:28:39,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {6010#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-14 23:28:39,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6010#true} {6010#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-14 23:28:39,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {6010#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:39,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {6016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {6010#true} is VALID [2022-04-14 23:28:39,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {6010#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-14 23:28:39,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6010#true} {6010#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-14 23:28:39,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {6010#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-14 23:28:39,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {6010#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {6010#true} is VALID [2022-04-14 23:28:39,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {6010#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {6010#true} is VALID [2022-04-14 23:28:39,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {6010#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {6010#true} is VALID [2022-04-14 23:28:39,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {6010#true} [149] L48-->L48-2: Formula: (= 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[] {6010#true} is VALID [2022-04-14 23:28:39,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {6010#true} [151] L48-2-->L52-1: 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[] {6010#true} is VALID [2022-04-14 23:28:39,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {6010#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {6010#true} is VALID [2022-04-14 23:28:39,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {6010#true} [154] L56-1-->L60-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] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:28:39,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {6015#(not (= main_~p4~0 0))} [156] L60-1-->L64-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] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:28:39,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {6015#(not (= main_~p4~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:28:39,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {6015#(not (= main_~p4~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:28:39,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {6015#(not (= main_~p4~0 0))} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:28:39,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {6015#(not (= main_~p4~0 0))} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {6015#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:28:39,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {6015#(not (= main_~p4~0 0))} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {6011#false} is VALID [2022-04-14 23:28:39,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {6011#false} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {6011#false} is VALID [2022-04-14 23:28:39,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {6011#false} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {6011#false} is VALID [2022-04-14 23:28:39,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {6011#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6011#false} is VALID [2022-04-14 23:28:39,090 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-14 23:28:39,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:39,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394450467] [2022-04-14 23:28:39,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394450467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:39,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:39,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781538963] [2022-04-14 23:28:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-14 23:28:39,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:39,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:39,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:39,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:39,105 INFO L87 Difference]: Start difference. First operand 305 states and 423 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,216 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2022-04-14 23:28:39,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:39,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-14 23:28:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-14 23:28:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-14 23:28:39,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2022-04-14 23:28:39,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:39,280 INFO L225 Difference]: With dead ends: 315 [2022-04-14 23:28:39,280 INFO L226 Difference]: Without dead ends: 315 [2022-04-14 23:28:39,280 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-14 23:28:39,281 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:39,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-14 23:28:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-14 23:28:39,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:39,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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-14 23:28:39,287 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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-14 23:28:39,287 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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-14 23:28:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,294 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2022-04-14 23:28:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 424 transitions. [2022-04-14 23:28:39,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:39,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:39,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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 315 states. [2022-04-14 23:28:39,296 INFO L87 Difference]: Start difference. First operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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 315 states. [2022-04-14 23:28:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,302 INFO L93 Difference]: Finished difference Result 315 states and 424 transitions. [2022-04-14 23:28:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 424 transitions. [2022-04-14 23:28:39,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:39,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:39,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:39,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 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-14 23:28:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 423 transitions. [2022-04-14 23:28:39,309 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 423 transitions. Word has length 21 [2022-04-14 23:28:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:39,310 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 423 transitions. [2022-04-14 23:28:39,310 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 423 transitions. [2022-04-14 23:28:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 23:28:39,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:39,311 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] [2022-04-14 23:28:39,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 23:28:39,311 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -496288577, now seen corresponding path program 1 times [2022-04-14 23:28:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:39,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879974065] [2022-04-14 23:28:39,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:39,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:39,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {7286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {7280#true} is VALID [2022-04-14 23:28:39,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {7280#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-14 23:28:39,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7280#true} {7280#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-14 23:28:39,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {7280#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:39,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {7286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {7280#true} is VALID [2022-04-14 23:28:39,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {7280#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-14 23:28:39,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7280#true} {7280#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-14 23:28:39,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {7280#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-14 23:28:39,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {7280#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {7280#true} is VALID [2022-04-14 23:28:39,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {7280#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {7280#true} is VALID [2022-04-14 23:28:39,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {7280#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {7280#true} is VALID [2022-04-14 23:28:39,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {7280#true} [149] L48-->L48-2: Formula: (= 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[] {7280#true} is VALID [2022-04-14 23:28:39,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {7280#true} [151] L48-2-->L52-1: 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[] {7280#true} is VALID [2022-04-14 23:28:39,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {7280#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-14 23:28:39,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {7280#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {7280#true} is VALID [2022-04-14 23:28:39,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {7280#true} [156] L60-1-->L64-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] {7285#(= main_~lk5~0 1)} is VALID [2022-04-14 23:28:39,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {7285#(= main_~lk5~0 1)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {7285#(= main_~lk5~0 1)} is VALID [2022-04-14 23:28:39,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {7285#(= main_~lk5~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-14 23:28:39,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {7285#(= main_~lk5~0 1)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-14 23:28:39,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {7285#(= main_~lk5~0 1)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-14 23:28:39,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {7285#(= main_~lk5~0 1)} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-14 23:28:39,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {7285#(= main_~lk5~0 1)} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {7285#(= main_~lk5~0 1)} is VALID [2022-04-14 23:28:39,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {7285#(= main_~lk5~0 1)} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {7281#false} is VALID [2022-04-14 23:28:39,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {7281#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7281#false} is VALID [2022-04-14 23:28:39,344 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-14 23:28:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:39,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879974065] [2022-04-14 23:28:39,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879974065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:39,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:39,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:39,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329110469] [2022-04-14 23:28:39,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:39,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-14 23:28:39,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:39,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:39,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:39,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:39,359 INFO L87 Difference]: Start difference. First operand 313 states and 423 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,468 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-04-14 23:28:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:39,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-14 23:28:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-14 23:28:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-14 23:28:39,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-14 23:28:39,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:39,530 INFO L225 Difference]: With dead ends: 523 [2022-04-14 23:28:39,530 INFO L226 Difference]: Without dead ends: 523 [2022-04-14 23:28:39,530 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-14 23:28:39,531 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:39,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-14 23:28:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-14 23:28:39,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:39,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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-14 23:28:39,540 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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-14 23:28:39,540 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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-14 23:28:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,554 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-04-14 23:28:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 696 transitions. [2022-04-14 23:28:39,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:39,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:39,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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 523 states. [2022-04-14 23:28:39,556 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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 523 states. [2022-04-14 23:28:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,570 INFO L93 Difference]: Finished difference Result 523 states and 696 transitions. [2022-04-14 23:28:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 696 transitions. [2022-04-14 23:28:39,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:39,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:39,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:39,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 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-14 23:28:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 599 transitions. [2022-04-14 23:28:39,583 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 599 transitions. Word has length 21 [2022-04-14 23:28:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:39,583 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 599 transitions. [2022-04-14 23:28:39,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 599 transitions. [2022-04-14 23:28:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 23:28:39,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:39,584 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] [2022-04-14 23:28:39,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 23:28:39,584 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1991224256, now seen corresponding path program 1 times [2022-04-14 23:28:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:39,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566115357] [2022-04-14 23:28:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:39,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:39,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {9324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {9318#true} is VALID [2022-04-14 23:28:39,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {9318#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-14 23:28:39,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9318#true} {9318#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-14 23:28:39,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {9318#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:39,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {9324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {9318#true} is VALID [2022-04-14 23:28:39,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {9318#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-14 23:28:39,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9318#true} {9318#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-14 23:28:39,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {9318#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-14 23:28:39,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {9318#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {9318#true} is VALID [2022-04-14 23:28:39,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {9318#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {9318#true} is VALID [2022-04-14 23:28:39,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {9318#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {9318#true} is VALID [2022-04-14 23:28:39,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {9318#true} [149] L48-->L48-2: Formula: (= 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[] {9318#true} is VALID [2022-04-14 23:28:39,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {9318#true} [151] L48-2-->L52-1: 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[] {9318#true} is VALID [2022-04-14 23:28:39,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {9318#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-14 23:28:39,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {9318#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {9318#true} is VALID [2022-04-14 23:28:39,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {9318#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-14 23:28:39,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {9323#(= main_~p5~0 0)} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {9323#(= main_~p5~0 0)} is VALID [2022-04-14 23:28:39,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {9323#(= main_~p5~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-14 23:28:39,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {9323#(= main_~p5~0 0)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-14 23:28:39,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {9323#(= main_~p5~0 0)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-14 23:28:39,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {9323#(= main_~p5~0 0)} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {9323#(= main_~p5~0 0)} is VALID [2022-04-14 23:28:39,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {9323#(= main_~p5~0 0)} [178] L89-1-->L95: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {9319#false} is VALID [2022-04-14 23:28:39,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {9319#false} [180] L95-->L100-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {9319#false} is VALID [2022-04-14 23:28:39,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {9319#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9319#false} is VALID [2022-04-14 23:28:39,638 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-14 23:28:39,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:39,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566115357] [2022-04-14 23:28:39,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566115357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:39,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:39,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:39,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467479667] [2022-04-14 23:28:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:39,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-14 23:28:39,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:39,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:39,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:39,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:39,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:39,655 INFO L87 Difference]: Start difference. First operand 457 states and 599 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,769 INFO L93 Difference]: Finished difference Result 587 states and 728 transitions. [2022-04-14 23:28:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2022-04-14 23:28:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-04-14 23:28:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-04-14 23:28:39,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2022-04-14 23:28:39,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:39,842 INFO L225 Difference]: With dead ends: 587 [2022-04-14 23:28:39,843 INFO L226 Difference]: Without dead ends: 587 [2022-04-14 23:28:39,843 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-14 23:28:39,843 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:39,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-14 23:28:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-14 23:28:39,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:39,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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-14 23:28:39,853 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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-14 23:28:39,853 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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-14 23:28:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,871 INFO L93 Difference]: Finished difference Result 587 states and 728 transitions. [2022-04-14 23:28:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 728 transitions. [2022-04-14 23:28:39,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:39,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:39,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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 587 states. [2022-04-14 23:28:39,873 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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 587 states. [2022-04-14 23:28:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:39,890 INFO L93 Difference]: Finished difference Result 587 states and 728 transitions. [2022-04-14 23:28:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 728 transitions. [2022-04-14 23:28:39,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:39,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:39,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:39,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 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-14 23:28:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 727 transitions. [2022-04-14 23:28:39,908 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 727 transitions. Word has length 21 [2022-04-14 23:28:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:39,908 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 727 transitions. [2022-04-14 23:28:39,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-14 23:28:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 727 transitions. [2022-04-14 23:28:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:28:39,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:39,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] [2022-04-14 23:28:39,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 23:28:39,910 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1794955734, now seen corresponding path program 1 times [2022-04-14 23:28:39,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:39,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99534506] [2022-04-14 23:28:39,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:39,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:39,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:39,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {11682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {11676#true} is VALID [2022-04-14 23:28:39,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {11676#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-14 23:28:39,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11676#true} {11676#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-14 23:28:39,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {11676#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:39,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {11682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {11676#true} is VALID [2022-04-14 23:28:39,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {11676#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-14 23:28:39,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11676#true} {11676#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-14 23:28:39,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {11676#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-14 23:28:39,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {11676#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {11676#true} is VALID [2022-04-14 23:28:39,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {11676#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {11676#true} is VALID [2022-04-14 23:28:39,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {11676#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {11676#true} is VALID [2022-04-14 23:28:39,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {11676#true} [149] L48-->L48-2: Formula: (= 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[] {11676#true} is VALID [2022-04-14 23:28:39,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {11676#true} [151] L48-2-->L52-1: 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[] {11676#true} is VALID [2022-04-14 23:28:39,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {11676#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-14 23:28:39,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {11676#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {11676#true} is VALID [2022-04-14 23:28:39,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {11676#true} [156] L60-1-->L64-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] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:28:39,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {11681#(not (= main_~p5~0 0))} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:28:39,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {11681#(not (= main_~p5~0 0))} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:28:39,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {11681#(not (= main_~p5~0 0))} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:28:39,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {11681#(not (= main_~p5~0 0))} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:28:39,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {11681#(not (= main_~p5~0 0))} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {11681#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:28:39,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {11681#(not (= main_~p5~0 0))} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {11677#false} is VALID [2022-04-14 23:28:39,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {11677#false} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {11677#false} is VALID [2022-04-14 23:28:39,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {11677#false} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {11677#false} is VALID [2022-04-14 23:28:39,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {11677#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11677#false} is VALID [2022-04-14 23:28:39,940 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-14 23:28:39,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:39,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99534506] [2022-04-14 23:28:39,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99534506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:39,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:39,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:39,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192301037] [2022-04-14 23:28:39,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:39,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-14 23:28:39,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:39,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:39,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:39,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:39,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:39,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:39,956 INFO L87 Difference]: Start difference. First operand 585 states and 727 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,064 INFO L93 Difference]: Finished difference Result 603 states and 728 transitions. [2022-04-14 23:28:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:40,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-14 23:28:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-04-14 23:28:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-04-14 23:28:40,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2022-04-14 23:28:40,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:40,143 INFO L225 Difference]: With dead ends: 603 [2022-04-14 23:28:40,143 INFO L226 Difference]: Without dead ends: 603 [2022-04-14 23:28:40,144 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-14 23:28:40,144 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:40,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-14 23:28:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-14 23:28:40,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:40,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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-14 23:28:40,154 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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-14 23:28:40,155 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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-14 23:28:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,172 INFO L93 Difference]: Finished difference Result 603 states and 728 transitions. [2022-04-14 23:28:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 728 transitions. [2022-04-14 23:28:40,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:40,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:40,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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 603 states. [2022-04-14 23:28:40,176 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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 603 states. [2022-04-14 23:28:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,193 INFO L93 Difference]: Finished difference Result 603 states and 728 transitions. [2022-04-14 23:28:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 728 transitions. [2022-04-14 23:28:40,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:40,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:40,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:40,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 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-14 23:28:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 727 transitions. [2022-04-14 23:28:40,213 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 727 transitions. Word has length 22 [2022-04-14 23:28:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:40,213 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 727 transitions. [2022-04-14 23:28:40,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 727 transitions. [2022-04-14 23:28:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:28:40,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:40,214 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] [2022-04-14 23:28:40,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 23:28:40,215 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:40,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1598442229, now seen corresponding path program 1 times [2022-04-14 23:28:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:40,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820208224] [2022-04-14 23:28:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:40,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {14098#true} is VALID [2022-04-14 23:28:40,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {14098#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-14 23:28:40,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14098#true} {14098#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-14 23:28:40,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {14098#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:40,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {14098#true} is VALID [2022-04-14 23:28:40,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {14098#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-14 23:28:40,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14098#true} {14098#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-14 23:28:40,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {14098#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-14 23:28:40,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {14098#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {14098#true} is VALID [2022-04-14 23:28:40,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {14098#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {14098#true} is VALID [2022-04-14 23:28:40,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {14098#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {14098#true} is VALID [2022-04-14 23:28:40,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {14098#true} [149] L48-->L48-2: Formula: (= 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[] {14098#true} is VALID [2022-04-14 23:28:40,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {14098#true} [151] L48-2-->L52-1: 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[] {14098#true} is VALID [2022-04-14 23:28:40,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {14098#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-14 23:28:40,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {14098#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-14 23:28:40,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {14098#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {14098#true} is VALID [2022-04-14 23:28:40,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {14098#true} [158] L64-1-->L68-1: Formula: (and (= v_main_~lk6~0_3 1) (not (= v_main_~p6~0_3 0))) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3, main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[main_~lk6~0] {14103#(= main_~lk6~0 1)} is VALID [2022-04-14 23:28:40,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {14103#(= main_~lk6~0 1)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-14 23:28:40,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {14103#(= main_~lk6~0 1)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-14 23:28:40,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {14103#(= main_~lk6~0 1)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-14 23:28:40,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {14103#(= main_~lk6~0 1)} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-14 23:28:40,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {14103#(= main_~lk6~0 1)} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-14 23:28:40,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {14103#(= main_~lk6~0 1)} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {14103#(= main_~lk6~0 1)} is VALID [2022-04-14 23:28:40,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {14103#(= main_~lk6~0 1)} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {14099#false} is VALID [2022-04-14 23:28:40,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {14099#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14099#false} is VALID [2022-04-14 23:28:40,259 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-14 23:28:40,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:40,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820208224] [2022-04-14 23:28:40,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820208224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:40,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:40,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:40,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863282853] [2022-04-14 23:28:40,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:40,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-14 23:28:40,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:40,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:40,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:40,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:40,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:40,278 INFO L87 Difference]: Start difference. First operand 601 states and 727 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,423 INFO L93 Difference]: Finished difference Result 969 states and 1127 transitions. [2022-04-14 23:28:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:40,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-14 23:28:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-14 23:28:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-14 23:28:40,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-14 23:28:40,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:40,513 INFO L225 Difference]: With dead ends: 969 [2022-04-14 23:28:40,513 INFO L226 Difference]: Without dead ends: 969 [2022-04-14 23:28:40,514 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-14 23:28:40,514 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:40,514 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-14 23:28:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-14 23:28:40,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:40,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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-14 23:28:40,529 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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-14 23:28:40,530 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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-14 23:28:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,569 INFO L93 Difference]: Finished difference Result 969 states and 1127 transitions. [2022-04-14 23:28:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1127 transitions. [2022-04-14 23:28:40,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:40,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:40,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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 969 states. [2022-04-14 23:28:40,573 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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 969 states. [2022-04-14 23:28:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,613 INFO L93 Difference]: Finished difference Result 969 states and 1127 transitions. [2022-04-14 23:28:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1127 transitions. [2022-04-14 23:28:40,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:40,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:40,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:40,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 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-14 23:28:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1063 transitions. [2022-04-14 23:28:40,652 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1063 transitions. Word has length 22 [2022-04-14 23:28:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:40,652 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1063 transitions. [2022-04-14 23:28:40,652 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1063 transitions. [2022-04-14 23:28:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:28:40,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:40,654 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] [2022-04-14 23:28:40,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 23:28:40,654 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash -209012234, now seen corresponding path program 1 times [2022-04-14 23:28:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:40,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390425280] [2022-04-14 23:28:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:40,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:40,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {17928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {17922#true} is VALID [2022-04-14 23:28:40,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {17922#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-14 23:28:40,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17922#true} {17922#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-14 23:28:40,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {17922#true} [135] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:40,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {17928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [137] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |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] {17922#true} is VALID [2022-04-14 23:28:40,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {17922#true} [140] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-14 23:28:40,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17922#true} {17922#true} [186] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-14 23:28:40,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {17922#true} [136] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-14 23:28:40,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {17922#true} [139] mainENTRY-->L99-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~p1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= 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~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |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) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_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|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~p4~0=v_main_~p4~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_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_1, main_~lk6~0=v_main_~lk6~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_~lk3~0, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_~p4~0, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk4~0, main_~p3~0, main_~lk6~0] {17922#true} is VALID [2022-04-14 23:28:40,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {17922#true} [143] L99-1-->L31: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet10_2| v_main_~cond~0_2)) InVars {main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet10, main_~cond~0] {17922#true} is VALID [2022-04-14 23:28:40,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {17922#true} [146] L31-->L48: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk1~0_4 0) (= v_main_~lk6~0_2 0) (= v_main_~lk2~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk5~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_5, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_4, main_~lk5~0=v_main_~lk5~0_2, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk5~0, main_~lk4~0, main_~lk6~0] {17922#true} is VALID [2022-04-14 23:28:40,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {17922#true} [149] L48-->L48-2: Formula: (= 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[] {17922#true} is VALID [2022-04-14 23:28:40,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {17922#true} [151] L48-2-->L52-1: 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[] {17922#true} is VALID [2022-04-14 23:28:40,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {17922#true} [153] L52-1-->L56-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-14 23:28:40,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {17922#true} [155] L56-1-->L60-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-14 23:28:40,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {17922#true} [157] L60-1-->L64-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {17922#true} is VALID [2022-04-14 23:28:40,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {17922#true} [159] L64-1-->L68-1: Formula: (= v_main_~p6~0_4 0) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-14 23:28:40,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {17927#(= main_~p6~0 0)} [161] L68-1-->L74-1: Formula: (= v_main_~p1~0_1 0) InVars {main_~p1~0=v_main_~p1~0_1} OutVars{main_~p1~0=v_main_~p1~0_1} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-14 23:28:40,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {17927#(= main_~p6~0 0)} [165] L74-1-->L79-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-14 23:28:40,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {17927#(= main_~p6~0 0)} [171] L79-1-->L84-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-14 23:28:40,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {17927#(= main_~p6~0 0)} [175] L84-1-->L89-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-14 23:28:40,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {17927#(= main_~p6~0 0)} [179] L89-1-->L94-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {17927#(= main_~p6~0 0)} is VALID [2022-04-14 23:28:40,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {17927#(= main_~p6~0 0)} [182] L94-1-->L100: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {17923#false} is VALID [2022-04-14 23:28:40,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {17923#false} [184] L100-->L100-1: Formula: (not (= v_main_~lk6~0_4 1)) InVars {main_~lk6~0=v_main_~lk6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_4} AuxVars[] AssignedVars[] {17923#false} is VALID [2022-04-14 23:28:40,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {17923#false} [166] L100-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17923#false} is VALID [2022-04-14 23:28:40,691 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-14 23:28:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:40,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390425280] [2022-04-14 23:28:40,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390425280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:40,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:40,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510092069] [2022-04-14 23:28:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-14 23:28:40,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:40,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:40,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:40,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:40,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:40,706 INFO L87 Difference]: Start difference. First operand 905 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,850 INFO L93 Difference]: Finished difference Result 1127 states and 1222 transitions. [2022-04-14 23:28:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:40,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2022-04-14 23:28:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-04-14 23:28:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-04-14 23:28:40,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2022-04-14 23:28:40,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:40,910 INFO L225 Difference]: With dead ends: 1127 [2022-04-14 23:28:40,910 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 23:28:40,910 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-14 23:28:40,912 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:40,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 23:28:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 23:28:40,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:40,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:28:40,913 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:28:40,913 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:28:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,914 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:28:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:28:40,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:40,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:40,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 23:28:40,914 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 23:28:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,914 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:28:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:28:40,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:40,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:40,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:40,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 23:28:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 23:28:40,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-14 23:28:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:40,915 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 23:28:40,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-14 23:28:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:28:40,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:40,919 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 23:28:40,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-14 23:28:40,923 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:40,925 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 23:28:40,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:28:40 BasicIcfg [2022-04-14 23:28:40,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 23:28:40,928 INFO L158 Benchmark]: Toolchain (without parser) took 6267.98ms. Allocated memory was 184.5MB in the beginning and 287.3MB in the end (delta: 102.8MB). Free memory was 127.6MB in the beginning and 163.6MB in the end (delta: -35.9MB). Peak memory consumption was 67.9MB. Max. memory is 8.0GB. [2022-04-14 23:28:40,928 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 23:28:40,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.41ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 127.4MB in the beginning and 210.2MB in the end (delta: -82.7MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-14 23:28:40,929 INFO L158 Benchmark]: Boogie Preprocessor took 25.75ms. Allocated memory is still 239.1MB. Free memory was 210.2MB in the beginning and 208.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 23:28:40,929 INFO L158 Benchmark]: RCFGBuilder took 296.69ms. Allocated memory is still 239.1MB. Free memory was 208.6MB in the beginning and 195.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-14 23:28:40,929 INFO L158 Benchmark]: IcfgTransformer took 32.79ms. Allocated memory is still 239.1MB. Free memory was 195.0MB in the beginning and 192.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 23:28:40,930 INFO L158 Benchmark]: TraceAbstraction took 5624.71ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 192.9MB in the beginning and 163.6MB in the end (delta: 29.3MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2022-04-14 23:28:40,932 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 184.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.41ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 127.4MB in the beginning and 210.2MB in the end (delta: -82.7MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.75ms. Allocated memory is still 239.1MB. Free memory was 210.2MB in the beginning and 208.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 296.69ms. Allocated memory is still 239.1MB. Free memory was 208.6MB in the beginning and 195.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 32.79ms. Allocated memory is still 239.1MB. Free memory was 195.0MB in the beginning and 192.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5624.71ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 192.9MB in the beginning and 163.6MB in the end (delta: 29.3MB). Peak memory consumption was 78.6MB. 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 - PositiveResult [Line: 107]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1320 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1320 mSDsluCounter, 1061 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 653 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 940 mSDtfsCounter, 653 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=16, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 23:28:40,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...