/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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 23:26:44,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 23:26:44,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 23:26:44,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 23:26:44,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 23:26:44,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 23:26:44,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 23:26:44,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 23:26:44,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 23:26:44,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 23:26:44,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 23:26:44,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 23:26:44,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 23:26:44,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 23:26:44,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 23:26:44,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 23:26:44,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 23:26:44,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 23:26:44,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 23:26:44,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 23:26:44,679 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 23:26:44,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 23:26:44,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 23:26:44,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 23:26:44,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 23:26:44,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 23:26:44,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 23:26:44,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 23:26:44,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 23:26:44,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 23:26:44,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 23:26:44,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 23:26:44,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 23:26:44,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 23:26:44,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 23:26:44,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 23:26:44,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 23:26:44,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 23:26:44,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 23:26:44,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 23:26:44,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 23:26:44,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 23:26:44,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 23:26:44,702 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 23:26:44,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 23:26:44,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 23:26:44,703 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 23:26:44,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 23:26:44,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 23:26:44,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 23:26:44,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 23:26:44,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 23:26:44,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 23:26:44,704 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 23:26:44,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 23:26:44,704 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 23:26:44,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 23:26:44,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 23:26:44,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 23:26:44,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 23:26:44,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 23:26:44,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:26:44,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 23:26:44,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 23:26:44,705 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 23:26:44,706 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:26:44,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 23:26:44,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 23:26:44,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 23:26:44,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 23:26:44,912 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 23:26:44,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2022-04-14 23:26:44,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ded0f453/aaa7e7c7dda846cfa72c7b200498f21a/FLAG13cc1df87 [2022-04-14 23:26:45,243 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 23:26:45,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-14 23:26:45,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ded0f453/aaa7e7c7dda846cfa72c7b200498f21a/FLAG13cc1df87 [2022-04-14 23:26:45,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ded0f453/aaa7e7c7dda846cfa72c7b200498f21a [2022-04-14 23:26:45,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 23:26:45,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 23:26:45,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 23:26:45,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 23:26:45,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 23:26:45,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d3e63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45, skipping insertion in model container [2022-04-14 23:26:45,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 23:26:45,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 23:26:45,876 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_10.c[3901,3914] [2022-04-14 23:26:45,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:26:45,886 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 23:26:45,900 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_10.c[3901,3914] [2022-04-14 23:26:45,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:26:45,909 INFO L208 MainTranslator]: Completed translation [2022-04-14 23:26:45,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45 WrapperNode [2022-04-14 23:26:45,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 23:26:45,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 23:26:45,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 23:26:45,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 23:26:45,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 23:26:45,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 23:26:45,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 23:26:45,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 23:26:45,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (1/1) ... [2022-04-14 23:26:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:26:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:26:45,970 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:26:45,987 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:26:46,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 23:26:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 23:26:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 23:26:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 23:26:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 23:26:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 23:26:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 23:26:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 23:26:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 23:26:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 23:26:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 23:26:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 23:26:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 23:26:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 23:26:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 23:26:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 23:26:46,073 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 23:26:46,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 23:26:46,280 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 23:26:46,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 23:26:46,301 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 23:26:46,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:26:46 BoogieIcfgContainer [2022-04-14 23:26:46,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 23:26:46,304 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 23:26:46,304 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 23:26:46,304 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 23:26:46,306 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:26:46" (1/1) ... [2022-04-14 23:26:46,308 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 23:26:46,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:26:46 BasicIcfg [2022-04-14 23:26:46,349 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 23:26:46,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 23:26:46,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 23:26:46,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 23:26:46,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:26:45" (1/4) ... [2022-04-14 23:26:46,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d485a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:26:46, skipping insertion in model container [2022-04-14 23:26:46,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:45" (2/4) ... [2022-04-14 23:26:46,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d485a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:26:46, skipping insertion in model container [2022-04-14 23:26:46,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:26:46" (3/4) ... [2022-04-14 23:26:46,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d485a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:26:46, skipping insertion in model container [2022-04-14 23:26:46,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:26:46" (4/4) ... [2022-04-14 23:26:46,354 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.cJordan [2022-04-14 23:26:46,357 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 23:26:46,357 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 23:26:46,382 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 23:26:46,386 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:26:46,386 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 23:26:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 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:26:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 23:26:46,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:46,402 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:26:46,402 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash -666508425, now seen corresponding path program 1 times [2022-04-14 23:26:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:46,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014301342] [2022-04-14 23:26:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:46,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:46,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:46,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {48#true} is VALID [2022-04-14 23:26:46,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-14 23:26:46,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-14 23:26:46,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {48#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:46,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {48#true} is VALID [2022-04-14 23:26:46,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-14 23:26:46,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-14 23:26:46,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#true} is VALID [2022-04-14 23:26:46,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {48#true} is VALID [2022-04-14 23:26:46,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {48#true} is VALID [2022-04-14 23:26:46,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {48#true} is VALID [2022-04-14 23:26:46,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#true} [216] L68-->L68-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= main_~lk1~0 1)} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(= main_~lk1~0 1)} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#(= main_~lk1~0 1)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(= main_~lk1~0 1)} [224] L80-1-->L84-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] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {53#(= main_~lk1~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {53#(= main_~lk1~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {53#(= main_~lk1~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {53#(= main_~lk1~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {53#(= main_~lk1~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {53#(= main_~lk1~0 1)} [236] L104-1-->L111: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {53#(= main_~lk1~0 1)} is VALID [2022-04-14 23:26:46,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} [238] L111-->L156-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {49#false} is VALID [2022-04-14 23:26:46,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49#false} is VALID [2022-04-14 23:26:46,607 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:26:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:46,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014301342] [2022-04-14 23:26:46,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014301342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:46,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:46,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283083430] [2022-04-14 23:26:46,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:46,613 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:26:46,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:46,616 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:26:46,635 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:26:46,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:46,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:46,650 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 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 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:26:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:46,917 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2022-04-14 23:26:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:46,917 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:26:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:46,918 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:26:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-14 23:26:46,925 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:26:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-14 23:26:46,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-14 23:26:47,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:47,052 INFO L225 Difference]: With dead ends: 81 [2022-04-14 23:26:47,053 INFO L226 Difference]: Without dead ends: 73 [2022-04-14 23:26:47,054 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:26:47,057 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:47,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:26:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-14 23:26:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-14 23:26:47,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:47,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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:26:47,086 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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:26:47,087 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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:26:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:47,092 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-14 23:26:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-14 23:26:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:47,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:47,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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 73 states. [2022-04-14 23:26:47,093 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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 73 states. [2022-04-14 23:26:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:47,097 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-14 23:26:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-14 23:26:47,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:47,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:47,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:47,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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:26:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-14 23:26:47,101 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-14 23:26:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:47,101 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-14 23:26:47,101 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:26:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-14 23:26:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 23:26:47,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:47,102 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:26:47,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 23:26:47,102 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:47,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -959911432, now seen corresponding path program 1 times [2022-04-14 23:26:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:47,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057436064] [2022-04-14 23:26:47,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:47,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {338#true} is VALID [2022-04-14 23:26:47,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-14 23:26:47,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338#true} {338#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-14 23:26:47,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {338#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:47,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {338#true} is VALID [2022-04-14 23:26:47,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {338#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-14 23:26:47,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338#true} {338#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-14 23:26:47,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {338#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#true} is VALID [2022-04-14 23:26:47,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {338#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {338#true} is VALID [2022-04-14 23:26:47,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {338#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {338#true} is VALID [2022-04-14 23:26:47,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {338#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {338#true} is VALID [2022-04-14 23:26:47,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(= main_~p1~0 0)} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#(= main_~p1~0 0)} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {343#(= main_~p1~0 0)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#(= main_~p1~0 0)} [224] L80-1-->L84-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] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {343#(= main_~p1~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {343#(= main_~p1~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {343#(= main_~p1~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {343#(= main_~p1~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {343#(= main_~p1~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {343#(= main_~p1~0 0)} is VALID [2022-04-14 23:26:47,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(= main_~p1~0 0)} [236] L104-1-->L111: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {339#false} is VALID [2022-04-14 23:26:47,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {339#false} [238] L111-->L156-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {339#false} is VALID [2022-04-14 23:26:47,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {339#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {339#false} is VALID [2022-04-14 23:26:47,194 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:26:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:47,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057436064] [2022-04-14 23:26:47,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057436064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:47,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:47,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708167845] [2022-04-14 23:26:47,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:47,197 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:26:47,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:47,197 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:26:47,213 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:26:47,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:47,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:47,215 INFO L87 Difference]: Start difference. First operand 51 states and 90 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:26:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:47,404 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-14 23:26:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:47,404 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:26:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:47,405 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:26:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-14 23:26:47,407 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:26:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-14 23:26:47,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 129 transitions. [2022-04-14 23:26:47,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:47,523 INFO L225 Difference]: With dead ends: 73 [2022-04-14 23:26:47,523 INFO L226 Difference]: Without dead ends: 73 [2022-04-14 23:26:47,526 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:26:47,528 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:47,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-14 23:26:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-14 23:26:47,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:47,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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:26:47,540 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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:26:47,541 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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:26:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:47,547 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-14 23:26:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-14 23:26:47,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:47,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:47,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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 73 states. [2022-04-14 23:26:47,552 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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 73 states. [2022-04-14 23:26:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:47,554 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-14 23:26:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-14 23:26:47,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:47,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:47,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:47,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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:26:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-14 23:26:47,557 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-14 23:26:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:47,558 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-14 23:26:47,558 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:26:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-14 23:26:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:26:47,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:47,559 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:26:47,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 23:26:47,559 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash 813107322, now seen corresponding path program 1 times [2022-04-14 23:26:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:47,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498658808] [2022-04-14 23:26:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:47,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {640#true} is VALID [2022-04-14 23:26:47,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {640#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#true} is VALID [2022-04-14 23:26:47,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {640#true} {640#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#true} is VALID [2022-04-14 23:26:47,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {640#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:47,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {640#true} is VALID [2022-04-14 23:26:47,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {640#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#true} is VALID [2022-04-14 23:26:47,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {640#true} {640#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#true} is VALID [2022-04-14 23:26:47,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {640#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#true} is VALID [2022-04-14 23:26:47,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {640#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {640#true} is VALID [2022-04-14 23:26:47,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {640#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {640#true} is VALID [2022-04-14 23:26:47,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {640#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {640#true} is VALID [2022-04-14 23:26:47,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {640#true} [216] L68-->L68-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {645#(not (= main_~p1~0 0))} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {645#(not (= main_~p1~0 0))} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {645#(not (= main_~p1~0 0))} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#(not (= main_~p1~0 0))} [224] L80-1-->L84-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] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {645#(not (= main_~p1~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#(not (= main_~p1~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {645#(not (= main_~p1~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {645#(not (= main_~p1~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {645#(not (= main_~p1~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {645#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:26:47,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#(not (= main_~p1~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {641#false} is VALID [2022-04-14 23:26:47,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {641#false} [240] L110-1-->L116: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {641#false} is VALID [2022-04-14 23:26:47,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {641#false} [244] L116-->L156-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {641#false} is VALID [2022-04-14 23:26:47,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {641#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {641#false} is VALID [2022-04-14 23:26:47,664 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:26:47,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:47,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498658808] [2022-04-14 23:26:47,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498658808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:47,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:47,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:47,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825175751] [2022-04-14 23:26:47,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:47,665 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:26:47,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:47,666 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:26:47,678 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:26:47,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:47,678 INFO L87 Difference]: Start difference. First operand 71 states and 126 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:26:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:47,806 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-14 23:26:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:47,806 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:26:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:47,807 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:26:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-04-14 23:26:47,809 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:26:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-04-14 23:26:47,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 128 transitions. [2022-04-14 23:26:47,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:47,896 INFO L225 Difference]: With dead ends: 76 [2022-04-14 23:26:47,896 INFO L226 Difference]: Without dead ends: 76 [2022-04-14 23:26:47,896 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:26:47,897 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:47,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-14 23:26:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-14 23:26:47,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:47,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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:26:47,900 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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:26:47,901 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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:26:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:47,902 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-14 23:26:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-14 23:26:47,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:47,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:47,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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 76 states. [2022-04-14 23:26:47,903 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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 76 states. [2022-04-14 23:26:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:47,905 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-14 23:26:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-14 23:26:47,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:47,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:47,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:47,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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:26:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-14 23:26:47,908 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-14 23:26:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:47,908 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-14 23:26:47,908 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:26:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-14 23:26:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:26:47,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:47,908 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:26:47,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 23:26:47,909 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash 307548697, now seen corresponding path program 1 times [2022-04-14 23:26:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:47,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505122015] [2022-04-14 23:26:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:47,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {954#true} is VALID [2022-04-14 23:26:47,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {954#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {954#true} is VALID [2022-04-14 23:26:47,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {954#true} {954#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {954#true} is VALID [2022-04-14 23:26:47,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {954#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:47,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {954#true} is VALID [2022-04-14 23:26:47,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {954#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {954#true} is VALID [2022-04-14 23:26:47,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {954#true} {954#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {954#true} is VALID [2022-04-14 23:26:47,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {954#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {954#true} is VALID [2022-04-14 23:26:47,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {954#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {954#true} is VALID [2022-04-14 23:26:47,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {954#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {954#true} is VALID [2022-04-14 23:26:47,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {954#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {954#true} is VALID [2022-04-14 23:26:47,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {954#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {954#true} is VALID [2022-04-14 23:26:47,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {954#true} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {959#(= main_~lk2~0 1)} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#(= main_~lk2~0 1)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {959#(= main_~lk2~0 1)} [224] L80-1-->L84-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] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#(= main_~lk2~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#(= main_~lk2~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {959#(= main_~lk2~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {959#(= main_~lk2~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {959#(= main_~lk2~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {959#(= main_~lk2~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {959#(= main_~lk2~0 1)} [240] L110-1-->L116: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {959#(= main_~lk2~0 1)} is VALID [2022-04-14 23:26:47,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(= main_~lk2~0 1)} [244] L116-->L156-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {955#false} is VALID [2022-04-14 23:26:47,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {955#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {955#false} is VALID [2022-04-14 23:26:47,978 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:26:47,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:47,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505122015] [2022-04-14 23:26:47,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505122015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:47,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:47,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:47,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560691858] [2022-04-14 23:26:47,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:47,979 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:26:47,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:47,979 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:26:47,992 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:26:47,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:47,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:47,993 INFO L87 Difference]: Start difference. First operand 74 states and 128 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:26:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,118 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2022-04-14 23:26:48,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:48,122 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:26:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:48,123 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:26:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:26:48,125 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:26:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:26:48,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-14 23:26:48,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:48,197 INFO L225 Difference]: With dead ends: 135 [2022-04-14 23:26:48,197 INFO L226 Difference]: Without dead ends: 135 [2022-04-14 23:26:48,197 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:26:48,204 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:48,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-14 23:26:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2022-04-14 23:26:48,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:48,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 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:26:48,228 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 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:26:48,228 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 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:26:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,231 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2022-04-14 23:26:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 238 transitions. [2022-04-14 23:26:48,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:48,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:48,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 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 135 states. [2022-04-14 23:26:48,232 INFO L87 Difference]: Start difference. First operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 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 135 states. [2022-04-14 23:26:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,235 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2022-04-14 23:26:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 238 transitions. [2022-04-14 23:26:48,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:48,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:48,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:48,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 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:26:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 169 transitions. [2022-04-14 23:26:48,238 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 169 transitions. Word has length 22 [2022-04-14 23:26:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:48,238 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 169 transitions. [2022-04-14 23:26:48,238 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:26:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 169 transitions. [2022-04-14 23:26:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:26:48,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:48,239 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:26:48,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 23:26:48,239 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash 14145690, now seen corresponding path program 1 times [2022-04-14 23:26:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:48,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733982781] [2022-04-14 23:26:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:48,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {1468#true} is VALID [2022-04-14 23:26:48,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1468#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1468#true} is VALID [2022-04-14 23:26:48,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1468#true} {1468#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1468#true} is VALID [2022-04-14 23:26:48,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {1468#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:48,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {1468#true} is VALID [2022-04-14 23:26:48,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {1468#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1468#true} is VALID [2022-04-14 23:26:48,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1468#true} {1468#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1468#true} is VALID [2022-04-14 23:26:48,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {1468#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1468#true} is VALID [2022-04-14 23:26:48,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {1468#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1468#true} is VALID [2022-04-14 23:26:48,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {1468#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {1468#true} is VALID [2022-04-14 23:26:48,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1468#true} is VALID [2022-04-14 23:26:48,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {1468#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1468#true} is VALID [2022-04-14 23:26:48,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {1468#true} [219] L68-2-->L72-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[] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {1473#(= main_~p2~0 0)} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {1473#(= main_~p2~0 0)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1473#(= main_~p2~0 0)} [224] L80-1-->L84-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] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#(= main_~p2~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {1473#(= main_~p2~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {1473#(= main_~p2~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {1473#(= main_~p2~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {1473#(= main_~p2~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {1473#(= main_~p2~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1473#(= main_~p2~0 0)} is VALID [2022-04-14 23:26:48,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#(= main_~p2~0 0)} [240] L110-1-->L116: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1469#false} is VALID [2022-04-14 23:26:48,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {1469#false} [244] L116-->L156-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1469#false} is VALID [2022-04-14 23:26:48,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {1469#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1469#false} is VALID [2022-04-14 23:26:48,287 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:26:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:48,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733982781] [2022-04-14 23:26:48,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733982781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:48,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:48,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:48,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958874009] [2022-04-14 23:26:48,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:48,288 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:26:48,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:48,288 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:26:48,300 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:26:48,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:48,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:48,301 INFO L87 Difference]: Start difference. First operand 97 states and 169 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:26:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,430 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2022-04-14 23:26:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:48,430 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:26:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:48,430 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:26:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-14 23:26:48,432 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:26:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-14 23:26:48,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-14 23:26:48,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:48,504 INFO L225 Difference]: With dead ends: 137 [2022-04-14 23:26:48,505 INFO L226 Difference]: Without dead ends: 137 [2022-04-14 23:26:48,505 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:26:48,505 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:48,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 97 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-14 23:26:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-14 23:26:48,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:48,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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:26:48,516 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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:26:48,516 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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:26:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,519 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2022-04-14 23:26:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 236 transitions. [2022-04-14 23:26:48,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:48,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:48,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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 137 states. [2022-04-14 23:26:48,520 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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 137 states. [2022-04-14 23:26:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,525 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2022-04-14 23:26:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 236 transitions. [2022-04-14 23:26:48,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:48,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:48,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:48,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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:26:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-14 23:26:48,528 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-14 23:26:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:48,529 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-14 23:26:48,529 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:26:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-14 23:26:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:26:48,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:48,529 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:48,529 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 23:26:48,530 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 944107156, now seen corresponding path program 1 times [2022-04-14 23:26:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:48,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789954370] [2022-04-14 23:26:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:48,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:48,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {2026#true} is VALID [2022-04-14 23:26:48,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-14 23:26:48,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2026#true} {2026#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-14 23:26:48,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:48,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {2026#true} is VALID [2022-04-14 23:26:48,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-14 23:26:48,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-14 23:26:48,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-14 23:26:48,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2026#true} is VALID [2022-04-14 23:26:48,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {2026#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {2026#true} is VALID [2022-04-14 23:26:48,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {2026#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2026#true} is VALID [2022-04-14 23:26:48,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-14 23:26:48,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#true} [218] L68-2-->L72-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {2031#(not (= main_~p2~0 0))} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {2031#(not (= main_~p2~0 0))} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {2031#(not (= main_~p2~0 0))} [224] L80-1-->L84-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] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {2031#(not (= main_~p2~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {2031#(not (= main_~p2~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {2031#(not (= main_~p2~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {2031#(not (= main_~p2~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {2031#(not (= main_~p2~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {2031#(not (= main_~p2~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2031#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:26:48,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {2031#(not (= main_~p2~0 0))} [241] L110-1-->L115-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[] {2027#false} is VALID [2022-04-14 23:26:48,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {2027#false} [246] L115-1-->L121: Formula: (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} AuxVars[] AssignedVars[] {2027#false} is VALID [2022-04-14 23:26:48,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {2027#false} [248] L121-->L156-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2027#false} is VALID [2022-04-14 23:26:48,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {2027#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2027#false} is VALID [2022-04-14 23:26:48,586 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:26:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:48,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789954370] [2022-04-14 23:26:48,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789954370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:48,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:48,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505832219] [2022-04-14 23:26:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-14 23:26:48,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:48,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:48,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:48,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:48,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:48,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:48,599 INFO L87 Difference]: Start difference. First operand 135 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,717 INFO L93 Difference]: Finished difference Result 139 states and 236 transitions. [2022-04-14 23:26:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-14 23:26:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:26:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:26:48,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-14 23:26:48,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:48,821 INFO L225 Difference]: With dead ends: 139 [2022-04-14 23:26:48,821 INFO L226 Difference]: Without dead ends: 139 [2022-04-14 23:26:48,822 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:26:48,822 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:48,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 110 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-14 23:26:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-04-14 23:26:48,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:48,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 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:26:48,825 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 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:26:48,825 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 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:26:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,828 INFO L93 Difference]: Finished difference Result 139 states and 236 transitions. [2022-04-14 23:26:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 236 transitions. [2022-04-14 23:26:48,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:48,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:48,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 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 139 states. [2022-04-14 23:26:48,829 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 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 139 states. [2022-04-14 23:26:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:48,831 INFO L93 Difference]: Finished difference Result 139 states and 236 transitions. [2022-04-14 23:26:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 236 transitions. [2022-04-14 23:26:48,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:48,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:48,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:48,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 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:26:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 235 transitions. [2022-04-14 23:26:48,834 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 235 transitions. Word has length 23 [2022-04-14 23:26:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:48,835 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 235 transitions. [2022-04-14 23:26:48,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 235 transitions. [2022-04-14 23:26:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:26:48,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:48,835 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:48,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 23:26:48,835 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:48,836 INFO L85 PathProgramCache]: Analyzing trace with hash 438548531, now seen corresponding path program 1 times [2022-04-14 23:26:48,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:48,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273482480] [2022-04-14 23:26:48,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:48,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:48,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {2598#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {2592#true} is VALID [2022-04-14 23:26:48,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {2592#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-14 23:26:48,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2592#true} {2592#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-14 23:26:48,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {2592#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2598#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:48,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {2598#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {2592#true} is VALID [2022-04-14 23:26:48,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {2592#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-14 23:26:48,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2592#true} {2592#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-14 23:26:48,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {2592#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-14 23:26:48,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {2592#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2592#true} is VALID [2022-04-14 23:26:48,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {2592#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {2592#true} is VALID [2022-04-14 23:26:48,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {2592#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2592#true} is VALID [2022-04-14 23:26:48,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {2592#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-14 23:26:48,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {2592#true} [219] L68-2-->L72-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[] {2592#true} is VALID [2022-04-14 23:26:48,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {2592#true} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {2597#(= main_~lk3~0 1)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {2597#(= main_~lk3~0 1)} [224] L80-1-->L84-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] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {2597#(= main_~lk3~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {2597#(= main_~lk3~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {2597#(= main_~lk3~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {2597#(= main_~lk3~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {2597#(= main_~lk3~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {2597#(= main_~lk3~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {2597#(= main_~lk3~0 1)} [241] L110-1-->L115-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[] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {2597#(= main_~lk3~0 1)} [246] L115-1-->L121: Formula: (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} AuxVars[] AssignedVars[] {2597#(= main_~lk3~0 1)} is VALID [2022-04-14 23:26:48,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {2597#(= main_~lk3~0 1)} [248] L121-->L156-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2593#false} is VALID [2022-04-14 23:26:48,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {2593#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2593#false} is VALID [2022-04-14 23:26:48,873 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:26:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:48,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273482480] [2022-04-14 23:26:48,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273482480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:48,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:48,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505390424] [2022-04-14 23:26:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:48,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-14 23:26:48,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:48,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:48,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:48,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:48,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:48,886 INFO L87 Difference]: Start difference. First operand 137 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,007 INFO L93 Difference]: Finished difference Result 251 states and 436 transitions. [2022-04-14 23:26:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:49,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-14 23:26:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:26:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:26:49,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2022-04-14 23:26:49,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:49,085 INFO L225 Difference]: With dead ends: 251 [2022-04-14 23:26:49,085 INFO L226 Difference]: Without dead ends: 251 [2022-04-14 23:26:49,085 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:26:49,087 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:49,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-14 23:26:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 185. [2022-04-14 23:26:49,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:49,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 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:26:49,091 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 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:26:49,091 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 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:26:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,096 INFO L93 Difference]: Finished difference Result 251 states and 436 transitions. [2022-04-14 23:26:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 436 transitions. [2022-04-14 23:26:49,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:49,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:49,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 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 251 states. [2022-04-14 23:26:49,097 INFO L87 Difference]: Start difference. First operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 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 251 states. [2022-04-14 23:26:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,103 INFO L93 Difference]: Finished difference Result 251 states and 436 transitions. [2022-04-14 23:26:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 436 transitions. [2022-04-14 23:26:49,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:49,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:49,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:49,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.723756906077348) internal successors, (312), 181 states have internal predecessors, (312), 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:26:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 315 transitions. [2022-04-14 23:26:49,107 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 315 transitions. Word has length 23 [2022-04-14 23:26:49,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:49,107 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 315 transitions. [2022-04-14 23:26:49,107 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 315 transitions. [2022-04-14 23:26:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:26:49,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:49,107 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:49,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 23:26:49,108 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 145145524, now seen corresponding path program 1 times [2022-04-14 23:26:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:49,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565624541] [2022-04-14 23:26:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:49,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {3548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {3542#true} is VALID [2022-04-14 23:26:49,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {3542#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#true} is VALID [2022-04-14 23:26:49,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3542#true} {3542#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#true} is VALID [2022-04-14 23:26:49,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {3542#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:49,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {3548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {3542#true} is VALID [2022-04-14 23:26:49,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {3542#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#true} is VALID [2022-04-14 23:26:49,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3542#true} {3542#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#true} is VALID [2022-04-14 23:26:49,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {3542#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#true} is VALID [2022-04-14 23:26:49,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3542#true} is VALID [2022-04-14 23:26:49,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {3542#true} is VALID [2022-04-14 23:26:49,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {3542#true} is VALID [2022-04-14 23:26:49,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {3542#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3542#true} is VALID [2022-04-14 23:26:49,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {3542#true} [219] L68-2-->L72-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[] {3542#true} is VALID [2022-04-14 23:26:49,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {3542#true} [221] L72-1-->L76-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[] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {3547#(= main_~p3~0 0)} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {3547#(= main_~p3~0 0)} [224] L80-1-->L84-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] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {3547#(= main_~p3~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {3547#(= main_~p3~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {3547#(= main_~p3~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {3547#(= main_~p3~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {3547#(= main_~p3~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {3547#(= main_~p3~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {3547#(= main_~p3~0 0)} [241] L110-1-->L115-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[] {3547#(= main_~p3~0 0)} is VALID [2022-04-14 23:26:49,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {3547#(= main_~p3~0 0)} [246] L115-1-->L121: Formula: (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} AuxVars[] AssignedVars[] {3543#false} is VALID [2022-04-14 23:26:49,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {3543#false} [248] L121-->L156-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {3543#false} is VALID [2022-04-14 23:26:49,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {3543#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3543#false} is VALID [2022-04-14 23:26:49,164 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:26:49,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:49,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565624541] [2022-04-14 23:26:49,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565624541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:49,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:49,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:49,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441914515] [2022-04-14 23:26:49,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:49,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-14 23:26:49,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:49,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:49,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:49,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:49,178 INFO L87 Difference]: Start difference. First operand 185 states and 315 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,313 INFO L93 Difference]: Finished difference Result 259 states and 436 transitions. [2022-04-14 23:26:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-14 23:26:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-04-14 23:26:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-04-14 23:26:49,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 125 transitions. [2022-04-14 23:26:49,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:49,403 INFO L225 Difference]: With dead ends: 259 [2022-04-14 23:26:49,403 INFO L226 Difference]: Without dead ends: 259 [2022-04-14 23:26:49,403 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:26:49,403 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:49,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:49,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-14 23:26:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-14 23:26:49,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:49,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 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:26:49,407 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 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:26:49,408 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 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:26:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,411 INFO L93 Difference]: Finished difference Result 259 states and 436 transitions. [2022-04-14 23:26:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2022-04-14 23:26:49,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:49,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:49,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 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 259 states. [2022-04-14 23:26:49,413 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 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 259 states. [2022-04-14 23:26:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,417 INFO L93 Difference]: Finished difference Result 259 states and 436 transitions. [2022-04-14 23:26:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2022-04-14 23:26:49,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:49,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:49,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:49,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 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:26:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 435 transitions. [2022-04-14 23:26:49,421 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 435 transitions. Word has length 23 [2022-04-14 23:26:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:49,421 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 435 transitions. [2022-04-14 23:26:49,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:26:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 435 transitions. [2022-04-14 23:26:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:26:49,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:49,422 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:49,422 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 23:26:49,422 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash 710134838, now seen corresponding path program 1 times [2022-04-14 23:26:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:49,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791433382] [2022-04-14 23:26:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:49,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:49,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {4594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {4588#true} is VALID [2022-04-14 23:26:49,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {4588#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4588#true} is VALID [2022-04-14 23:26:49,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4588#true} {4588#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4588#true} is VALID [2022-04-14 23:26:49,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {4588#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:49,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {4594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {4588#true} is VALID [2022-04-14 23:26:49,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {4588#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4588#true} is VALID [2022-04-14 23:26:49,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4588#true} {4588#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4588#true} is VALID [2022-04-14 23:26:49,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {4588#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4588#true} is VALID [2022-04-14 23:26:49,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {4588#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4588#true} is VALID [2022-04-14 23:26:49,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {4588#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {4588#true} is VALID [2022-04-14 23:26:49,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {4588#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {4588#true} is VALID [2022-04-14 23:26:49,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {4588#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {4588#true} is VALID [2022-04-14 23:26:49,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {4588#true} [219] L68-2-->L72-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[] {4588#true} is VALID [2022-04-14 23:26:49,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {4588#true} [220] L72-1-->L76-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {4593#(not (= main_~p3~0 0))} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {4593#(not (= main_~p3~0 0))} [224] L80-1-->L84-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] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {4593#(not (= main_~p3~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {4593#(not (= main_~p3~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {4593#(not (= main_~p3~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {4593#(not (= main_~p3~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {4593#(not (= main_~p3~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {4593#(not (= main_~p3~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {4593#(not (= main_~p3~0 0))} [241] L110-1-->L115-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[] {4593#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:26:49,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {4593#(not (= main_~p3~0 0))} [247] L115-1-->L120-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[] {4589#false} is VALID [2022-04-14 23:26:49,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {4589#false} [250] L120-1-->L126: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {4589#false} is VALID [2022-04-14 23:26:49,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {4589#false} [252] L126-->L156-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {4589#false} is VALID [2022-04-14 23:26:49,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {4589#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4589#false} is VALID [2022-04-14 23:26:49,453 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:26:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:49,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791433382] [2022-04-14 23:26:49,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791433382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:49,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:49,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755720157] [2022-04-14 23:26:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-14 23:26:49,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:49,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:49,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:49,467 INFO L87 Difference]: Start difference. First operand 257 states and 435 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,593 INFO L93 Difference]: Finished difference Result 263 states and 436 transitions. [2022-04-14 23:26:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:49,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-14 23:26:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-14 23:26:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-14 23:26:49,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-14 23:26:49,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:49,678 INFO L225 Difference]: With dead ends: 263 [2022-04-14 23:26:49,678 INFO L226 Difference]: Without dead ends: 263 [2022-04-14 23:26:49,679 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:26:49,679 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:49,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-14 23:26:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-14 23:26:49,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:49,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 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:26:49,683 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 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:26:49,683 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 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:26:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,687 INFO L93 Difference]: Finished difference Result 263 states and 436 transitions. [2022-04-14 23:26:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 436 transitions. [2022-04-14 23:26:49,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:49,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:49,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 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 263 states. [2022-04-14 23:26:49,688 INFO L87 Difference]: Start difference. First operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 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 263 states. [2022-04-14 23:26:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,692 INFO L93 Difference]: Finished difference Result 263 states and 436 transitions. [2022-04-14 23:26:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 436 transitions. [2022-04-14 23:26:49,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:49,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:49,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:49,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 257 states have internal predecessors, (432), 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:26:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2022-04-14 23:26:49,696 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 24 [2022-04-14 23:26:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:49,696 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2022-04-14 23:26:49,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2022-04-14 23:26:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:26:49,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:49,697 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:49,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 23:26:49,697 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 204576213, now seen corresponding path program 1 times [2022-04-14 23:26:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:49,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471440729] [2022-04-14 23:26:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:49,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:49,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {5656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {5650#true} is VALID [2022-04-14 23:26:49,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {5650#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5650#true} is VALID [2022-04-14 23:26:49,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5650#true} {5650#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5650#true} is VALID [2022-04-14 23:26:49,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {5650#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:49,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {5656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {5650#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5650#true} {5650#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {5650#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {5650#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {5650#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {5650#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {5650#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {5650#true} [219] L68-2-->L72-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[] {5650#true} is VALID [2022-04-14 23:26:49,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {5650#true} [221] L72-1-->L76-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[] {5650#true} is VALID [2022-04-14 23:26:49,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {5650#true} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {5655#(= main_~lk4~0 1)} [224] L80-1-->L84-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] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {5655#(= main_~lk4~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {5655#(= main_~lk4~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {5655#(= main_~lk4~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {5655#(= main_~lk4~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {5655#(= main_~lk4~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {5655#(= main_~lk4~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {5655#(= main_~lk4~0 1)} [241] L110-1-->L115-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[] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {5655#(= main_~lk4~0 1)} [247] L115-1-->L120-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[] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {5655#(= main_~lk4~0 1)} [250] L120-1-->L126: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {5655#(= main_~lk4~0 1)} is VALID [2022-04-14 23:26:49,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {5655#(= main_~lk4~0 1)} [252] L126-->L156-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {5651#false} is VALID [2022-04-14 23:26:49,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {5651#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5651#false} is VALID [2022-04-14 23:26:49,755 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:26:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:49,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471440729] [2022-04-14 23:26:49,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471440729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:49,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:49,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:49,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699356277] [2022-04-14 23:26:49,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:49,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-14 23:26:49,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:49,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:49,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:49,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:49,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:49,770 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:49,905 INFO L93 Difference]: Finished difference Result 475 states and 800 transitions. [2022-04-14 23:26:49,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-14 23:26:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-14 23:26:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-14 23:26:49,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-14 23:26:49,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:49,991 INFO L225 Difference]: With dead ends: 475 [2022-04-14 23:26:49,991 INFO L226 Difference]: Without dead ends: 475 [2022-04-14 23:26:49,991 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:26:49,992 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:49,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-14 23:26:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-14 23:26:49,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:49,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 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:26:49,998 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 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:26:50,000 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 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:26:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,009 INFO L93 Difference]: Finished difference Result 475 states and 800 transitions. [2022-04-14 23:26:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 800 transitions. [2022-04-14 23:26:50,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:50,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:50,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 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 475 states. [2022-04-14 23:26:50,011 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 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 475 states. [2022-04-14 23:26:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,026 INFO L93 Difference]: Finished difference Result 475 states and 800 transitions. [2022-04-14 23:26:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 800 transitions. [2022-04-14 23:26:50,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:50,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:50,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:50,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.6470588235294117) internal successors, (588), 357 states have internal predecessors, (588), 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:26:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 591 transitions. [2022-04-14 23:26:50,033 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 591 transitions. Word has length 24 [2022-04-14 23:26:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:50,033 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 591 transitions. [2022-04-14 23:26:50,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 591 transitions. [2022-04-14 23:26:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:26:50,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:50,033 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:50,033 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 23:26:50,034 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash -88826794, now seen corresponding path program 1 times [2022-04-14 23:26:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:50,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178736039] [2022-04-14 23:26:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:50,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {7454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {7448#true} is VALID [2022-04-14 23:26:50,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {7448#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7448#true} is VALID [2022-04-14 23:26:50,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7448#true} {7448#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7448#true} is VALID [2022-04-14 23:26:50,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {7448#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:50,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {7454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {7448#true} is VALID [2022-04-14 23:26:50,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {7448#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7448#true} is VALID [2022-04-14 23:26:50,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7448#true} {7448#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7448#true} is VALID [2022-04-14 23:26:50,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {7448#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7448#true} is VALID [2022-04-14 23:26:50,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {7448#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {7448#true} is VALID [2022-04-14 23:26:50,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {7448#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {7448#true} is VALID [2022-04-14 23:26:50,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {7448#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {7448#true} is VALID [2022-04-14 23:26:50,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {7448#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {7448#true} is VALID [2022-04-14 23:26:50,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {7448#true} [219] L68-2-->L72-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[] {7448#true} is VALID [2022-04-14 23:26:50,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {7448#true} [221] L72-1-->L76-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[] {7448#true} is VALID [2022-04-14 23:26:50,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {7448#true} [223] L76-1-->L80-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[] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {7453#(= main_~p4~0 0)} [224] L80-1-->L84-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] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {7453#(= main_~p4~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {7453#(= main_~p4~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {7453#(= main_~p4~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {7453#(= main_~p4~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {7453#(= main_~p4~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {7453#(= main_~p4~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {7453#(= main_~p4~0 0)} [241] L110-1-->L115-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[] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {7453#(= main_~p4~0 0)} [247] L115-1-->L120-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[] {7453#(= main_~p4~0 0)} is VALID [2022-04-14 23:26:50,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {7453#(= main_~p4~0 0)} [250] L120-1-->L126: Formula: (not (= v_main_~p4~0_4 0)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {7449#false} is VALID [2022-04-14 23:26:50,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {7449#false} [252] L126-->L156-1: Formula: (not (= v_main_~lk4~0_4 1)) InVars {main_~lk4~0=v_main_~lk4~0_4} OutVars{main_~lk4~0=v_main_~lk4~0_4} AuxVars[] AssignedVars[] {7449#false} is VALID [2022-04-14 23:26:50,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {7449#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7449#false} is VALID [2022-04-14 23:26:50,102 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:26:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178736039] [2022-04-14 23:26:50,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178736039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:50,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:50,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:50,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005846532] [2022-04-14 23:26:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:50,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-14 23:26:50,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:50,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:50,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:50,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:50,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:50,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:50,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:50,117 INFO L87 Difference]: Start difference. First operand 361 states and 591 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,237 INFO L93 Difference]: Finished difference Result 499 states and 808 transitions. [2022-04-14 23:26:50,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:50,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-14 23:26:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-14 23:26:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-14 23:26:50,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-14 23:26:50,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:50,326 INFO L225 Difference]: With dead ends: 499 [2022-04-14 23:26:50,326 INFO L226 Difference]: Without dead ends: 499 [2022-04-14 23:26:50,326 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:26:50,327 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:50,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-14 23:26:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-14 23:26:50,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:50,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 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:26:50,333 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 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:26:50,334 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 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:26:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,343 INFO L93 Difference]: Finished difference Result 499 states and 808 transitions. [2022-04-14 23:26:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 808 transitions. [2022-04-14 23:26:50,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:50,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:50,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 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 499 states. [2022-04-14 23:26:50,345 INFO L87 Difference]: Start difference. First operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 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 499 states. [2022-04-14 23:26:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,354 INFO L93 Difference]: Finished difference Result 499 states and 808 transitions. [2022-04-14 23:26:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 808 transitions. [2022-04-14 23:26:50,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:50,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:50,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:50,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6308316430020284) internal successors, (804), 493 states have internal predecessors, (804), 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:26:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 807 transitions. [2022-04-14 23:26:50,364 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 807 transitions. Word has length 24 [2022-04-14 23:26:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:50,364 INFO L478 AbstractCegarLoop]: Abstraction has 497 states and 807 transitions. [2022-04-14 23:26:50,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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:26:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 807 transitions. [2022-04-14 23:26:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:26:50,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:50,365 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:50,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 23:26:50,365 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:50,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:50,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2046927696, now seen corresponding path program 1 times [2022-04-14 23:26:50,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:50,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103322101] [2022-04-14 23:26:50,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:50,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:50,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:50,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {9460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {9454#true} is VALID [2022-04-14 23:26:50,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {9454#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9454#true} is VALID [2022-04-14 23:26:50,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9454#true} {9454#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9454#true} is VALID [2022-04-14 23:26:50,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {9454#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:50,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {9460#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {9454#true} is VALID [2022-04-14 23:26:50,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {9454#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9454#true} is VALID [2022-04-14 23:26:50,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9454#true} {9454#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9454#true} is VALID [2022-04-14 23:26:50,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {9454#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9454#true} is VALID [2022-04-14 23:26:50,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {9454#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {9454#true} is VALID [2022-04-14 23:26:50,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {9454#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {9454#true} is VALID [2022-04-14 23:26:50,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {9454#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {9454#true} is VALID [2022-04-14 23:26:50,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {9454#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {9454#true} is VALID [2022-04-14 23:26:50,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {9454#true} [219] L68-2-->L72-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[] {9454#true} is VALID [2022-04-14 23:26:50,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {9454#true} [221] L72-1-->L76-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[] {9454#true} is VALID [2022-04-14 23:26:50,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {9454#true} [222] L76-1-->L80-1: Formula: (and (= v_main_~lk4~0_3 1) (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, main_~lk4~0=v_main_~lk4~0_3} AuxVars[] AssignedVars[main_~lk4~0] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {9459#(not (= main_~p4~0 0))} [224] L80-1-->L84-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] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {9459#(not (= main_~p4~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {9459#(not (= main_~p4~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {9459#(not (= main_~p4~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {9459#(not (= main_~p4~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {9459#(not (= main_~p4~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {9459#(not (= main_~p4~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {9459#(not (= main_~p4~0 0))} [241] L110-1-->L115-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[] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {9459#(not (= main_~p4~0 0))} [247] L115-1-->L120-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[] {9459#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:26:50,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {9459#(not (= main_~p4~0 0))} [251] L120-1-->L125-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[] {9455#false} is VALID [2022-04-14 23:26:50,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {9455#false} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {9455#false} is VALID [2022-04-14 23:26:50,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {9455#false} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {9455#false} is VALID [2022-04-14 23:26:50,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {9455#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9455#false} is VALID [2022-04-14 23:26:50,398 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:26:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:50,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103322101] [2022-04-14 23:26:50,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103322101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:50,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:50,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123490347] [2022-04-14 23:26:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:50,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:26:50,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:50,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:50,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:50,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:50,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:50,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:50,412 INFO L87 Difference]: Start difference. First operand 497 states and 807 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,546 INFO L93 Difference]: Finished difference Result 507 states and 808 transitions. [2022-04-14 23:26:50,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:50,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:26:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:26:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:26:50,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2022-04-14 23:26:50,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:50,632 INFO L225 Difference]: With dead ends: 507 [2022-04-14 23:26:50,632 INFO L226 Difference]: Without dead ends: 507 [2022-04-14 23:26:50,633 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:26:50,633 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:50,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-14 23:26:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-14 23:26:50,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:50,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 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:26:50,639 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 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:26:50,640 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 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:26:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,648 INFO L93 Difference]: Finished difference Result 507 states and 808 transitions. [2022-04-14 23:26:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 808 transitions. [2022-04-14 23:26:50,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:50,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:50,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 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 507 states. [2022-04-14 23:26:50,650 INFO L87 Difference]: Start difference. First operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 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 507 states. [2022-04-14 23:26:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,659 INFO L93 Difference]: Finished difference Result 507 states and 808 transitions. [2022-04-14 23:26:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 808 transitions. [2022-04-14 23:26:50,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:50,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:50,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:50,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6047904191616766) internal successors, (804), 501 states have internal predecessors, (804), 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:26:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 807 transitions. [2022-04-14 23:26:50,670 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 807 transitions. Word has length 25 [2022-04-14 23:26:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:50,670 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 807 transitions. [2022-04-14 23:26:50,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 807 transitions. [2022-04-14 23:26:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:26:50,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:50,671 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:50,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 23:26:50,671 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:50,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1541369071, now seen corresponding path program 1 times [2022-04-14 23:26:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:50,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594143569] [2022-04-14 23:26:50,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:50,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {11498#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {11492#true} is VALID [2022-04-14 23:26:50,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {11492#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11492#true} is VALID [2022-04-14 23:26:50,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11492#true} {11492#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11492#true} is VALID [2022-04-14 23:26:50,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {11492#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11498#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:50,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {11498#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {11492#true} is VALID [2022-04-14 23:26:50,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {11492#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11492#true} is VALID [2022-04-14 23:26:50,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11492#true} {11492#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11492#true} is VALID [2022-04-14 23:26:50,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {11492#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11492#true} is VALID [2022-04-14 23:26:50,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {11492#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {11492#true} is VALID [2022-04-14 23:26:50,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {11492#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {11492#true} is VALID [2022-04-14 23:26:50,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {11492#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {11492#true} is VALID [2022-04-14 23:26:50,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {11492#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {11492#true} is VALID [2022-04-14 23:26:50,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {11492#true} [219] L68-2-->L72-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[] {11492#true} is VALID [2022-04-14 23:26:50,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {11492#true} [221] L72-1-->L76-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[] {11492#true} is VALID [2022-04-14 23:26:50,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {11492#true} [223] L76-1-->L80-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[] {11492#true} is VALID [2022-04-14 23:26:50,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {11492#true} [224] L80-1-->L84-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] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {11497#(= main_~lk5~0 1)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {11497#(= main_~lk5~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {11497#(= main_~lk5~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {11497#(= main_~lk5~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {11497#(= main_~lk5~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {11497#(= main_~lk5~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {11497#(= main_~lk5~0 1)} [241] L110-1-->L115-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[] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {11497#(= main_~lk5~0 1)} [247] L115-1-->L120-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[] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {11497#(= main_~lk5~0 1)} [251] L120-1-->L125-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[] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {11497#(= main_~lk5~0 1)} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {11497#(= main_~lk5~0 1)} is VALID [2022-04-14 23:26:50,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {11497#(= main_~lk5~0 1)} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {11493#false} is VALID [2022-04-14 23:26:50,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {11493#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11493#false} is VALID [2022-04-14 23:26:50,701 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:26:50,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:50,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594143569] [2022-04-14 23:26:50,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594143569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:50,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:50,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769381652] [2022-04-14 23:26:50,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:50,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:26:50,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:50,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:50,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:50,724 INFO L87 Difference]: Start difference. First operand 505 states and 807 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:50,898 INFO L93 Difference]: Finished difference Result 907 states and 1464 transitions. [2022-04-14 23:26:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:26:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:26:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:26:50,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-14 23:26:50,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:50,993 INFO L225 Difference]: With dead ends: 907 [2022-04-14 23:26:50,993 INFO L226 Difference]: Without dead ends: 907 [2022-04-14 23:26:50,993 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:26:50,993 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:50,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-14 23:26:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-14 23:26:51,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:51,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 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:26:51,004 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 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:26:51,004 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 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:26:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:51,030 INFO L93 Difference]: Finished difference Result 907 states and 1464 transitions. [2022-04-14 23:26:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1464 transitions. [2022-04-14 23:26:51,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:51,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:51,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 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 907 states. [2022-04-14 23:26:51,033 INFO L87 Difference]: Start difference. First operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 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 907 states. [2022-04-14 23:26:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:51,059 INFO L93 Difference]: Finished difference Result 907 states and 1464 transitions. [2022-04-14 23:26:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1464 transitions. [2022-04-14 23:26:51,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:51,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:51,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:51,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5627644569816643) internal successors, (1108), 709 states have internal predecessors, (1108), 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:26:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1111 transitions. [2022-04-14 23:26:51,077 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1111 transitions. Word has length 25 [2022-04-14 23:26:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:51,077 INFO L478 AbstractCegarLoop]: Abstraction has 713 states and 1111 transitions. [2022-04-14 23:26:51,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1111 transitions. [2022-04-14 23:26:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:26:51,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:51,078 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:51,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 23:26:51,078 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1247966064, now seen corresponding path program 1 times [2022-04-14 23:26:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:51,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478367332] [2022-04-14 23:26:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:51,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {14944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {14938#true} is VALID [2022-04-14 23:26:51,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {14938#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14938#true} is VALID [2022-04-14 23:26:51,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14938#true} {14938#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14938#true} is VALID [2022-04-14 23:26:51,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {14938#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:51,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {14944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {14938#true} is VALID [2022-04-14 23:26:51,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {14938#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14938#true} is VALID [2022-04-14 23:26:51,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14938#true} {14938#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14938#true} is VALID [2022-04-14 23:26:51,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {14938#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14938#true} is VALID [2022-04-14 23:26:51,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {14938#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {14938#true} is VALID [2022-04-14 23:26:51,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {14938#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {14938#true} is VALID [2022-04-14 23:26:51,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {14938#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {14938#true} is VALID [2022-04-14 23:26:51,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {14938#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {14938#true} is VALID [2022-04-14 23:26:51,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {14938#true} [219] L68-2-->L72-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[] {14938#true} is VALID [2022-04-14 23:26:51,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {14938#true} [221] L72-1-->L76-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[] {14938#true} is VALID [2022-04-14 23:26:51,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {14938#true} [223] L76-1-->L80-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[] {14938#true} is VALID [2022-04-14 23:26:51,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {14938#true} [225] L80-1-->L84-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[] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {14943#(= main_~p5~0 0)} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {14943#(= main_~p5~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {14943#(= main_~p5~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {14943#(= main_~p5~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {14943#(= main_~p5~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {14943#(= main_~p5~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {14943#(= main_~p5~0 0)} [241] L110-1-->L115-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[] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {14943#(= main_~p5~0 0)} [247] L115-1-->L120-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[] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {14943#(= main_~p5~0 0)} [251] L120-1-->L125-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[] {14943#(= main_~p5~0 0)} is VALID [2022-04-14 23:26:51,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {14943#(= main_~p5~0 0)} [254] L125-1-->L131: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {14939#false} is VALID [2022-04-14 23:26:51,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {14939#false} [256] L131-->L156-1: Formula: (not (= v_main_~lk5~0_1 1)) InVars {main_~lk5~0=v_main_~lk5~0_1} OutVars{main_~lk5~0=v_main_~lk5~0_1} AuxVars[] AssignedVars[] {14939#false} is VALID [2022-04-14 23:26:51,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {14939#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14939#false} is VALID [2022-04-14 23:26:51,116 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:26:51,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:51,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478367332] [2022-04-14 23:26:51,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478367332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:51,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:51,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384614778] [2022-04-14 23:26:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:26:51,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:51,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:51,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:51,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:51,131 INFO L87 Difference]: Start difference. First operand 713 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:51,280 INFO L93 Difference]: Finished difference Result 971 states and 1496 transitions. [2022-04-14 23:26:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:51,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-14 23:26:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-14 23:26:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-14 23:26:51,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-04-14 23:26:51,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:51,379 INFO L225 Difference]: With dead ends: 971 [2022-04-14 23:26:51,380 INFO L226 Difference]: Without dead ends: 971 [2022-04-14 23:26:51,380 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:26:51,380 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:51,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-14 23:26:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-14 23:26:51,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:51,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 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:26:51,391 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 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:26:51,392 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 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:26:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:51,419 INFO L93 Difference]: Finished difference Result 971 states and 1496 transitions. [2022-04-14 23:26:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1496 transitions. [2022-04-14 23:26:51,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:51,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:51,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 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 971 states. [2022-04-14 23:26:51,422 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 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 971 states. [2022-04-14 23:26:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:51,450 INFO L93 Difference]: Finished difference Result 971 states and 1496 transitions. [2022-04-14 23:26:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1496 transitions. [2022-04-14 23:26:51,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:51,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:51,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:51,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5461139896373057) internal successors, (1492), 965 states have internal predecessors, (1492), 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:26:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1495 transitions. [2022-04-14 23:26:51,478 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1495 transitions. Word has length 25 [2022-04-14 23:26:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:51,479 INFO L478 AbstractCegarLoop]: Abstraction has 969 states and 1495 transitions. [2022-04-14 23:26:51,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:26:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1495 transitions. [2022-04-14 23:26:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:26:51,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:51,480 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:51,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 23:26:51,480 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 537833458, now seen corresponding path program 1 times [2022-04-14 23:26:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:51,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116726308] [2022-04-14 23:26:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:51,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {18838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {18832#true} is VALID [2022-04-14 23:26:51,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {18832#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18832#true} is VALID [2022-04-14 23:26:51,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18832#true} {18832#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18832#true} is VALID [2022-04-14 23:26:51,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {18832#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:51,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {18838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {18832#true} is VALID [2022-04-14 23:26:51,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {18832#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18832#true} is VALID [2022-04-14 23:26:51,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18832#true} {18832#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18832#true} is VALID [2022-04-14 23:26:51,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {18832#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18832#true} is VALID [2022-04-14 23:26:51,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {18832#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {18832#true} is VALID [2022-04-14 23:26:51,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {18832#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {18832#true} is VALID [2022-04-14 23:26:51,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {18832#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {18832#true} is VALID [2022-04-14 23:26:51,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {18832#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {18832#true} is VALID [2022-04-14 23:26:51,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {18832#true} [219] L68-2-->L72-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[] {18832#true} is VALID [2022-04-14 23:26:51,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {18832#true} [221] L72-1-->L76-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[] {18832#true} is VALID [2022-04-14 23:26:51,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {18832#true} [223] L76-1-->L80-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[] {18832#true} is VALID [2022-04-14 23:26:51,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {18832#true} [224] L80-1-->L84-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] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {18837#(not (= main_~p5~0 0))} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {18837#(not (= main_~p5~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {18837#(not (= main_~p5~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {18837#(not (= main_~p5~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {18837#(not (= main_~p5~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {18837#(not (= main_~p5~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {18837#(not (= main_~p5~0 0))} [241] L110-1-->L115-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[] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {18837#(not (= main_~p5~0 0))} [247] L115-1-->L120-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[] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {18837#(not (= main_~p5~0 0))} [251] L120-1-->L125-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[] {18837#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:26:51,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {18837#(not (= main_~p5~0 0))} [255] L125-1-->L130-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[] {18833#false} is VALID [2022-04-14 23:26:51,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {18833#false} [258] L130-1-->L136: 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[] {18833#false} is VALID [2022-04-14 23:26:51,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {18833#false} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {18833#false} is VALID [2022-04-14 23:26:51,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {18833#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18833#false} is VALID [2022-04-14 23:26:51,514 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:26:51,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:51,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116726308] [2022-04-14 23:26:51,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116726308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:51,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:51,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296202208] [2022-04-14 23:26:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:51,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-14 23:26:51,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:51,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:51,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:51,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:51,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:51,528 INFO L87 Difference]: Start difference. First operand 969 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:51,672 INFO L93 Difference]: Finished difference Result 987 states and 1496 transitions. [2022-04-14 23:26:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:51,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-14 23:26:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-14 23:26:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-14 23:26:51,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-04-14 23:26:51,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:51,771 INFO L225 Difference]: With dead ends: 987 [2022-04-14 23:26:51,771 INFO L226 Difference]: Without dead ends: 987 [2022-04-14 23:26:51,771 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:26:51,772 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:51,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-14 23:26:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-14 23:26:51,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:51,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 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:26:51,782 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 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:26:51,783 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 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:26:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:51,810 INFO L93 Difference]: Finished difference Result 987 states and 1496 transitions. [2022-04-14 23:26:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1496 transitions. [2022-04-14 23:26:51,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:51,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:51,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 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 987 states. [2022-04-14 23:26:51,813 INFO L87 Difference]: Start difference. First operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 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 987 states. [2022-04-14 23:26:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:51,842 INFO L93 Difference]: Finished difference Result 987 states and 1496 transitions. [2022-04-14 23:26:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1496 transitions. [2022-04-14 23:26:51,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:51,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:51,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:51,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5208970438328238) internal successors, (1492), 981 states have internal predecessors, (1492), 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:26:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1495 transitions. [2022-04-14 23:26:51,872 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1495 transitions. Word has length 26 [2022-04-14 23:26:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:51,872 INFO L478 AbstractCegarLoop]: Abstraction has 985 states and 1495 transitions. [2022-04-14 23:26:51,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1495 transitions. [2022-04-14 23:26:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:26:51,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:51,873 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:51,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 23:26:51,873 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 32274833, now seen corresponding path program 1 times [2022-04-14 23:26:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:51,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679353339] [2022-04-14 23:26:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:51,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {22796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {22790#true} is VALID [2022-04-14 23:26:51,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {22790#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22790#true} is VALID [2022-04-14 23:26:51,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22790#true} {22790#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22790#true} is VALID [2022-04-14 23:26:51,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {22790#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:51,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {22796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {22790#true} is VALID [2022-04-14 23:26:51,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {22790#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22790#true} is VALID [2022-04-14 23:26:51,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22790#true} {22790#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22790#true} is VALID [2022-04-14 23:26:51,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {22790#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22790#true} is VALID [2022-04-14 23:26:51,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {22790#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {22790#true} is VALID [2022-04-14 23:26:51,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {22790#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {22790#true} is VALID [2022-04-14 23:26:51,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {22790#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {22790#true} is VALID [2022-04-14 23:26:51,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {22790#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {22790#true} is VALID [2022-04-14 23:26:51,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {22790#true} [219] L68-2-->L72-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[] {22790#true} is VALID [2022-04-14 23:26:51,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {22790#true} [221] L72-1-->L76-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[] {22790#true} is VALID [2022-04-14 23:26:51,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {22790#true} [223] L76-1-->L80-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[] {22790#true} is VALID [2022-04-14 23:26:51,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {22790#true} [225] L80-1-->L84-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[] {22790#true} is VALID [2022-04-14 23:26:51,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {22790#true} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {22795#(= main_~lk6~0 1)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {22795#(= main_~lk6~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {22795#(= main_~lk6~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {22795#(= main_~lk6~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {22795#(= main_~lk6~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {22795#(= main_~lk6~0 1)} [241] L110-1-->L115-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[] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {22795#(= main_~lk6~0 1)} [247] L115-1-->L120-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[] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {22795#(= main_~lk6~0 1)} [251] L120-1-->L125-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[] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {22795#(= main_~lk6~0 1)} [255] L125-1-->L130-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[] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {22795#(= main_~lk6~0 1)} [258] L130-1-->L136: 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[] {22795#(= main_~lk6~0 1)} is VALID [2022-04-14 23:26:51,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {22795#(= main_~lk6~0 1)} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {22791#false} is VALID [2022-04-14 23:26:51,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {22791#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22791#false} is VALID [2022-04-14 23:26:51,928 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:26:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:51,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679353339] [2022-04-14 23:26:51,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679353339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:51,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:51,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075865357] [2022-04-14 23:26:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:51,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-14 23:26:51,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:51,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:51,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:51,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:51,943 INFO L87 Difference]: Start difference. First operand 985 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:52,134 INFO L93 Difference]: Finished difference Result 1739 states and 2664 transitions. [2022-04-14 23:26:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:52,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-14 23:26:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:26:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:26:52,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 110 transitions. [2022-04-14 23:26:52,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:52,278 INFO L225 Difference]: With dead ends: 1739 [2022-04-14 23:26:52,279 INFO L226 Difference]: Without dead ends: 1739 [2022-04-14 23:26:52,279 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:26:52,279 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:52,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-14 23:26:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-14 23:26:52,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:52,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 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:26:52,295 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 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:26:52,296 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 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:26:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:52,374 INFO L93 Difference]: Finished difference Result 1739 states and 2664 transitions. [2022-04-14 23:26:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2664 transitions. [2022-04-14 23:26:52,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:52,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:52,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 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 1739 states. [2022-04-14 23:26:52,379 INFO L87 Difference]: Start difference. First operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 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 1739 states. [2022-04-14 23:26:52,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:52,457 INFO L93 Difference]: Finished difference Result 1739 states and 2664 transitions. [2022-04-14 23:26:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2664 transitions. [2022-04-14 23:26:52,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:52,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:52,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:52,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.4748761500353857) internal successors, (2084), 1413 states have internal predecessors, (2084), 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:26:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2087 transitions. [2022-04-14 23:26:52,511 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2087 transitions. Word has length 26 [2022-04-14 23:26:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:52,512 INFO L478 AbstractCegarLoop]: Abstraction has 1417 states and 2087 transitions. [2022-04-14 23:26:52,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2087 transitions. [2022-04-14 23:26:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:26:52,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:52,513 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:52,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 23:26:52,513 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash -261128174, now seen corresponding path program 1 times [2022-04-14 23:26:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:52,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276893943] [2022-04-14 23:26:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:52,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {29442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {29436#true} is VALID [2022-04-14 23:26:52,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {29436#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29436#true} is VALID [2022-04-14 23:26:52,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29436#true} {29436#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29436#true} is VALID [2022-04-14 23:26:52,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {29436#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {29442#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {29436#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29436#true} {29436#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {29436#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {29436#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {29436#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {29436#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {29436#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {29436#true} [219] L68-2-->L72-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[] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {29436#true} [221] L72-1-->L76-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[] {29436#true} is VALID [2022-04-14 23:26:52,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {29436#true} [223] L76-1-->L80-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[] {29436#true} is VALID [2022-04-14 23:26:52,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {29436#true} [225] L80-1-->L84-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[] {29436#true} is VALID [2022-04-14 23:26:52,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {29436#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {29441#(= main_~p6~0 0)} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {29441#(= main_~p6~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {29441#(= main_~p6~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {29441#(= main_~p6~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {29441#(= main_~p6~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {29441#(= main_~p6~0 0)} [241] L110-1-->L115-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[] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {29441#(= main_~p6~0 0)} [247] L115-1-->L120-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[] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {29441#(= main_~p6~0 0)} [251] L120-1-->L125-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[] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {29441#(= main_~p6~0 0)} [255] L125-1-->L130-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[] {29441#(= main_~p6~0 0)} is VALID [2022-04-14 23:26:52,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {29441#(= main_~p6~0 0)} [258] L130-1-->L136: 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[] {29437#false} is VALID [2022-04-14 23:26:52,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {29437#false} [260] L136-->L156-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {29437#false} is VALID [2022-04-14 23:26:52,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {29437#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29437#false} is VALID [2022-04-14 23:26:52,545 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:26:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:52,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276893943] [2022-04-14 23:26:52,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276893943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:52,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:52,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714521596] [2022-04-14 23:26:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:52,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-14 23:26:52,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:52,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:52,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:52,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:52,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:52,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:52,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:52,559 INFO L87 Difference]: Start difference. First operand 1417 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:52,770 INFO L93 Difference]: Finished difference Result 1899 states and 2760 transitions. [2022-04-14 23:26:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-14 23:26:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-14 23:26:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-14 23:26:52,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-14 23:26:52,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:52,938 INFO L225 Difference]: With dead ends: 1899 [2022-04-14 23:26:52,939 INFO L226 Difference]: Without dead ends: 1899 [2022-04-14 23:26:52,939 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:26:52,939 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:52,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-14 23:26:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-14 23:26:52,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:52,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 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:26:52,961 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 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:26:52,962 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 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:26:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:53,050 INFO L93 Difference]: Finished difference Result 1899 states and 2760 transitions. [2022-04-14 23:26:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2760 transitions. [2022-04-14 23:26:53,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:53,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:53,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 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 1899 states. [2022-04-14 23:26:53,056 INFO L87 Difference]: Start difference. First operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 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 1899 states. [2022-04-14 23:26:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:53,145 INFO L93 Difference]: Finished difference Result 1899 states and 2760 transitions. [2022-04-14 23:26:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2760 transitions. [2022-04-14 23:26:53,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:53,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:53,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:53,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4558901215002642) internal successors, (2756), 1893 states have internal predecessors, (2756), 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:26:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2759 transitions. [2022-04-14 23:26:53,241 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2759 transitions. Word has length 26 [2022-04-14 23:26:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:53,241 INFO L478 AbstractCegarLoop]: Abstraction has 1897 states and 2759 transitions. [2022-04-14 23:26:53,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:26:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2759 transitions. [2022-04-14 23:26:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:26:53,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:53,243 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:53,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-14 23:26:53,243 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1000552460, now seen corresponding path program 1 times [2022-04-14 23:26:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:53,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351514780] [2022-04-14 23:26:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:53,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {37048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {37042#true} is VALID [2022-04-14 23:26:53,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {37042#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37042#true} is VALID [2022-04-14 23:26:53,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37042#true} {37042#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37042#true} is VALID [2022-04-14 23:26:53,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {37042#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:53,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {37048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {37042#true} is VALID [2022-04-14 23:26:53,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {37042#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37042#true} is VALID [2022-04-14 23:26:53,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37042#true} {37042#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37042#true} is VALID [2022-04-14 23:26:53,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {37042#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {37042#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {37042#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {37042#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {37042#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {37042#true} [219] L68-2-->L72-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[] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {37042#true} [221] L72-1-->L76-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[] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {37042#true} [223] L76-1-->L80-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[] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {37042#true} [225] L80-1-->L84-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[] {37042#true} is VALID [2022-04-14 23:26:53,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {37042#true} [226] L84-1-->L88-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {37047#(not (= main_~p6~0 0))} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {37047#(not (= main_~p6~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {37047#(not (= main_~p6~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {37047#(not (= main_~p6~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {37047#(not (= main_~p6~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {37047#(not (= main_~p6~0 0))} [241] L110-1-->L115-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[] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {37047#(not (= main_~p6~0 0))} [247] L115-1-->L120-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[] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {37047#(not (= main_~p6~0 0))} [251] L120-1-->L125-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[] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {37047#(not (= main_~p6~0 0))} [255] L125-1-->L130-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[] {37047#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:26:53,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {37047#(not (= main_~p6~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {37043#false} is VALID [2022-04-14 23:26:53,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {37043#false} [262] L135-1-->L141: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {37043#false} is VALID [2022-04-14 23:26:53,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {37043#false} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {37043#false} is VALID [2022-04-14 23:26:53,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {37043#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37043#false} is VALID [2022-04-14 23:26:53,269 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:26:53,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:53,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351514780] [2022-04-14 23:26:53,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351514780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:53,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:53,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938542165] [2022-04-14 23:26:53,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:53,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-14 23:26:53,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:53,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:53,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:53,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:53,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:53,284 INFO L87 Difference]: Start difference. First operand 1897 states and 2759 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:53,522 INFO L93 Difference]: Finished difference Result 1931 states and 2760 transitions. [2022-04-14 23:26:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:53,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-14 23:26:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-14 23:26:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-14 23:26:53,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-14 23:26:53,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:53,700 INFO L225 Difference]: With dead ends: 1931 [2022-04-14 23:26:53,700 INFO L226 Difference]: Without dead ends: 1931 [2022-04-14 23:26:53,700 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:26:53,701 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:53,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 98 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-14 23:26:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-14 23:26:53,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:53,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 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:26:53,722 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 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:26:53,723 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 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:26:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:53,820 INFO L93 Difference]: Finished difference Result 1931 states and 2760 transitions. [2022-04-14 23:26:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2760 transitions. [2022-04-14 23:26:53,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:53,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:53,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 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 1931 states. [2022-04-14 23:26:53,826 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 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 1931 states. [2022-04-14 23:26:53,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:53,920 INFO L93 Difference]: Finished difference Result 1931 states and 2760 transitions. [2022-04-14 23:26:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2760 transitions. [2022-04-14 23:26:53,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:53,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:53,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:53,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.4316883116883117) internal successors, (2756), 1925 states have internal predecessors, (2756), 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:26:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2759 transitions. [2022-04-14 23:26:54,016 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2759 transitions. Word has length 27 [2022-04-14 23:26:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:54,016 INFO L478 AbstractCegarLoop]: Abstraction has 1929 states and 2759 transitions. [2022-04-14 23:26:54,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2759 transitions. [2022-04-14 23:26:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:26:54,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:54,017 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:54,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-14 23:26:54,017 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 494993835, now seen corresponding path program 1 times [2022-04-14 23:26:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:54,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323096642] [2022-04-14 23:26:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:54,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:54,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {44782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {44776#true} is VALID [2022-04-14 23:26:54,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {44776#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44776#true} is VALID [2022-04-14 23:26:54,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44776#true} {44776#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44776#true} is VALID [2022-04-14 23:26:54,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {44776#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:54,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {44782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {44776#true} is VALID [2022-04-14 23:26:54,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {44776#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44776#true} {44776#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {44776#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {44776#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {44776#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {44776#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {44776#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {44776#true} [219] L68-2-->L72-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[] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {44776#true} [221] L72-1-->L76-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[] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {44776#true} [223] L76-1-->L80-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[] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {44776#true} [225] L80-1-->L84-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[] {44776#true} is VALID [2022-04-14 23:26:54,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {44776#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {44776#true} is VALID [2022-04-14 23:26:54,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {44776#true} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {44781#(= main_~lk7~0 1)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {44781#(= main_~lk7~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {44781#(= main_~lk7~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {44781#(= main_~lk7~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {44781#(= main_~lk7~0 1)} [241] L110-1-->L115-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[] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {44781#(= main_~lk7~0 1)} [247] L115-1-->L120-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[] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {44781#(= main_~lk7~0 1)} [251] L120-1-->L125-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[] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {44781#(= main_~lk7~0 1)} [255] L125-1-->L130-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[] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {44781#(= main_~lk7~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {44781#(= main_~lk7~0 1)} [262] L135-1-->L141: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {44781#(= main_~lk7~0 1)} is VALID [2022-04-14 23:26:54,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {44781#(= main_~lk7~0 1)} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {44777#false} is VALID [2022-04-14 23:26:54,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {44777#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44777#false} is VALID [2022-04-14 23:26:54,054 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:26:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:54,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323096642] [2022-04-14 23:26:54,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323096642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:54,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:54,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043133257] [2022-04-14 23:26:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:54,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-14 23:26:54,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:54,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:54,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:54,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:54,070 INFO L87 Difference]: Start difference. First operand 1929 states and 2759 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:54,478 INFO L93 Difference]: Finished difference Result 3339 states and 4808 transitions. [2022-04-14 23:26:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:54,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-14 23:26:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-14 23:26:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-14 23:26:54,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-14 23:26:54,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:54,853 INFO L225 Difference]: With dead ends: 3339 [2022-04-14 23:26:54,853 INFO L226 Difference]: Without dead ends: 3339 [2022-04-14 23:26:54,854 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:26:54,854 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:54,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-14 23:26:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-14 23:26:54,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:54,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 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:26:54,900 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 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:26:54,901 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 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:26:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:55,181 INFO L93 Difference]: Finished difference Result 3339 states and 4808 transitions. [2022-04-14 23:26:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4808 transitions. [2022-04-14 23:26:55,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:55,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:55,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 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 3339 states. [2022-04-14 23:26:55,190 INFO L87 Difference]: Start difference. First operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 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 3339 states. [2022-04-14 23:26:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:55,468 INFO L93 Difference]: Finished difference Result 3339 states and 4808 transitions. [2022-04-14 23:26:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4808 transitions. [2022-04-14 23:26:55,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:55,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:55,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:55,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.3853243530662886) internal successors, (3908), 2821 states have internal predecessors, (3908), 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:26:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3911 transitions. [2022-04-14 23:26:55,676 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3911 transitions. Word has length 27 [2022-04-14 23:26:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:55,677 INFO L478 AbstractCegarLoop]: Abstraction has 2825 states and 3911 transitions. [2022-04-14 23:26:55,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3911 transitions. [2022-04-14 23:26:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:26:55,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:55,679 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:55,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-14 23:26:55,679 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 201590828, now seen corresponding path program 1 times [2022-04-14 23:26:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:55,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814027480] [2022-04-14 23:26:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:55,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {57636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {57630#true} is VALID [2022-04-14 23:26:55,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {57630#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57630#true} is VALID [2022-04-14 23:26:55,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57630#true} {57630#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57630#true} is VALID [2022-04-14 23:26:55,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {57630#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:55,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {57636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {57630#true} is VALID [2022-04-14 23:26:55,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {57630#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57630#true} is VALID [2022-04-14 23:26:55,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57630#true} {57630#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57630#true} is VALID [2022-04-14 23:26:55,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {57630#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {57630#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {57630#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {57630#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {57630#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {57630#true} [219] L68-2-->L72-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[] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {57630#true} [221] L72-1-->L76-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[] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {57630#true} [223] L76-1-->L80-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[] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {57630#true} [225] L80-1-->L84-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[] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {57630#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {57630#true} is VALID [2022-04-14 23:26:55,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {57630#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {57635#(= main_~p7~0 0)} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {57635#(= main_~p7~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {57635#(= main_~p7~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {57635#(= main_~p7~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {57635#(= main_~p7~0 0)} [241] L110-1-->L115-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[] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {57635#(= main_~p7~0 0)} [247] L115-1-->L120-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[] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {57635#(= main_~p7~0 0)} [251] L120-1-->L125-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[] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {57635#(= main_~p7~0 0)} [255] L125-1-->L130-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[] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {57635#(= main_~p7~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {57635#(= main_~p7~0 0)} is VALID [2022-04-14 23:26:55,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {57635#(= main_~p7~0 0)} [262] L135-1-->L141: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {57631#false} is VALID [2022-04-14 23:26:55,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {57631#false} [264] L141-->L156-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {57631#false} is VALID [2022-04-14 23:26:55,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {57631#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57631#false} is VALID [2022-04-14 23:26:55,709 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:26:55,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:55,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814027480] [2022-04-14 23:26:55,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814027480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:55,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:55,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054757855] [2022-04-14 23:26:55,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:55,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-14 23:26:55,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:55,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:55,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:55,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:55,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:55,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:55,725 INFO L87 Difference]: Start difference. First operand 2825 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:56,164 INFO L93 Difference]: Finished difference Result 3723 states and 5064 transitions. [2022-04-14 23:26:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:56,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-14 23:26:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-14 23:26:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-14 23:26:56,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-04-14 23:26:56,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:56,639 INFO L225 Difference]: With dead ends: 3723 [2022-04-14 23:26:56,639 INFO L226 Difference]: Without dead ends: 3723 [2022-04-14 23:26:56,639 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:26:56,640 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:56,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-14 23:26:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-14 23:26:56,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:56,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 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:26:56,678 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 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:26:56,680 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 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:26:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:57,021 INFO L93 Difference]: Finished difference Result 3723 states and 5064 transitions. [2022-04-14 23:26:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5064 transitions. [2022-04-14 23:26:57,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:57,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:57,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 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 3723 states. [2022-04-14 23:26:57,032 INFO L87 Difference]: Start difference. First operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 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 3723 states. [2022-04-14 23:26:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:57,377 INFO L93 Difference]: Finished difference Result 3723 states and 5064 transitions. [2022-04-14 23:26:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5064 transitions. [2022-04-14 23:26:57,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:57,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:57,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:57,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3613128867366155) internal successors, (5060), 3717 states have internal predecessors, (5060), 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:26:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5063 transitions. [2022-04-14 23:26:57,752 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5063 transitions. Word has length 27 [2022-04-14 23:26:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:57,752 INFO L478 AbstractCegarLoop]: Abstraction has 3721 states and 5063 transitions. [2022-04-14 23:26:57,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:26:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5063 transitions. [2022-04-14 23:26:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:26:57,754 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:57,754 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:57,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-14 23:26:57,755 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1835027538, now seen corresponding path program 1 times [2022-04-14 23:26:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:57,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125153721] [2022-04-14 23:26:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:57,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {72538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {72532#true} is VALID [2022-04-14 23:26:57,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {72532#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72532#true} is VALID [2022-04-14 23:26:57,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72532#true} {72532#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {72532#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:57,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {72538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {72532#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72532#true} {72532#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {72532#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {72532#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {72532#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {72532#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {72532#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {72532#true} is VALID [2022-04-14 23:26:57,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {72532#true} [219] L68-2-->L72-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[] {72532#true} is VALID [2022-04-14 23:26:57,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {72532#true} [221] L72-1-->L76-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[] {72532#true} is VALID [2022-04-14 23:26:57,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {72532#true} [223] L76-1-->L80-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[] {72532#true} is VALID [2022-04-14 23:26:57,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {72532#true} [225] L80-1-->L84-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[] {72532#true} is VALID [2022-04-14 23:26:57,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {72532#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {72532#true} is VALID [2022-04-14 23:26:57,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {72532#true} [228] L88-1-->L92-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {72537#(not (= main_~p7~0 0))} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {72537#(not (= main_~p7~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {72537#(not (= main_~p7~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {72537#(not (= main_~p7~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {72537#(not (= main_~p7~0 0))} [241] L110-1-->L115-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[] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {72537#(not (= main_~p7~0 0))} [247] L115-1-->L120-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[] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {72537#(not (= main_~p7~0 0))} [251] L120-1-->L125-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[] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {72537#(not (= main_~p7~0 0))} [255] L125-1-->L130-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[] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {72537#(not (= main_~p7~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {72537#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:26:57,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {72537#(not (= main_~p7~0 0))} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {72533#false} is VALID [2022-04-14 23:26:57,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {72533#false} [266] L140-1-->L146: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {72533#false} is VALID [2022-04-14 23:26:57,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {72533#false} [268] L146-->L156-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {72533#false} is VALID [2022-04-14 23:26:57,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {72533#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72533#false} is VALID [2022-04-14 23:26:57,795 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:26:57,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:57,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125153721] [2022-04-14 23:26:57,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125153721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:57,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:57,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:57,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488079289] [2022-04-14 23:26:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:57,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-14 23:26:57,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:57,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:26:57,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:57,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:57,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:57,810 INFO L87 Difference]: Start difference. First operand 3721 states and 5063 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:26:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:58,302 INFO L93 Difference]: Finished difference Result 3787 states and 5064 transitions. [2022-04-14 23:26:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:26:58,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-14 23:26:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:26:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:26:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-04-14 23:26:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:26:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-04-14 23:26:58,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 116 transitions. [2022-04-14 23:26:58,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:58,748 INFO L225 Difference]: With dead ends: 3787 [2022-04-14 23:26:58,749 INFO L226 Difference]: Without dead ends: 3787 [2022-04-14 23:26:58,749 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:26:58,749 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:26:58,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:26:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-14 23:26:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-14 23:26:58,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:26:58,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 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:26:58,789 INFO L74 IsIncluded]: Start isIncluded. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 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:26:58,792 INFO L87 Difference]: Start difference. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 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:26:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:59,153 INFO L93 Difference]: Finished difference Result 3787 states and 5064 transitions. [2022-04-14 23:26:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5064 transitions. [2022-04-14 23:26:59,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:59,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:59,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 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 3787 states. [2022-04-14 23:26:59,164 INFO L87 Difference]: Start difference. First operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 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 3787 states. [2022-04-14 23:26:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:26:59,527 INFO L93 Difference]: Finished difference Result 3787 states and 5064 transitions. [2022-04-14 23:26:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5064 transitions. [2022-04-14 23:26:59,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:26:59,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:26:59,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:26:59,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:26:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.3382702988627346) internal successors, (5060), 3781 states have internal predecessors, (5060), 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:26:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5063 transitions. [2022-04-14 23:26:59,928 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5063 transitions. Word has length 28 [2022-04-14 23:26:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:26:59,928 INFO L478 AbstractCegarLoop]: Abstraction has 3785 states and 5063 transitions. [2022-04-14 23:26:59,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:26:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5063 transitions. [2022-04-14 23:26:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:26:59,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:26:59,931 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:26:59,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-14 23:26:59,931 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:26:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:26:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1954381133, now seen corresponding path program 1 times [2022-04-14 23:26:59,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:26:59,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396752379] [2022-04-14 23:26:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:26:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:26:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:26:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:26:59,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {87696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {87690#true} is VALID [2022-04-14 23:26:59,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {87690#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87690#true} is VALID [2022-04-14 23:26:59,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87690#true} {87690#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87690#true} is VALID [2022-04-14 23:26:59,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {87690#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:26:59,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {87696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {87690#true} is VALID [2022-04-14 23:26:59,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {87690#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87690#true} is VALID [2022-04-14 23:26:59,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87690#true} {87690#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {87690#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {87690#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {87690#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {87690#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {87690#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {87690#true} [219] L68-2-->L72-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[] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {87690#true} [221] L72-1-->L76-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[] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {87690#true} [223] L76-1-->L80-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[] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {87690#true} [225] L80-1-->L84-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[] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {87690#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {87690#true} is VALID [2022-04-14 23:26:59,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {87690#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {87690#true} is VALID [2022-04-14 23:26:59,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {87690#true} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {87695#(= main_~lk8~0 1)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {87695#(= main_~lk8~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {87695#(= main_~lk8~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {87695#(= main_~lk8~0 1)} [241] L110-1-->L115-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[] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {87695#(= main_~lk8~0 1)} [247] L115-1-->L120-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[] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {87695#(= main_~lk8~0 1)} [251] L120-1-->L125-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[] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {87695#(= main_~lk8~0 1)} [255] L125-1-->L130-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[] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {87695#(= main_~lk8~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {87695#(= main_~lk8~0 1)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {87695#(= main_~lk8~0 1)} [266] L140-1-->L146: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {87695#(= main_~lk8~0 1)} is VALID [2022-04-14 23:26:59,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {87695#(= main_~lk8~0 1)} [268] L146-->L156-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {87691#false} is VALID [2022-04-14 23:26:59,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {87691#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87691#false} is VALID [2022-04-14 23:26:59,962 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:26:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:26:59,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396752379] [2022-04-14 23:26:59,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396752379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:26:59,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:26:59,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:26:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864107801] [2022-04-14 23:26:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:26:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-14 23:26:59,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:26:59,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:26:59,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:26:59,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:26:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:26:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:26:59,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:26:59,976 INFO L87 Difference]: Start difference. First operand 3785 states and 5063 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:01,143 INFO L93 Difference]: Finished difference Result 6411 states and 8584 transitions. [2022-04-14 23:27:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:01,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-14 23:27:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-14 23:27:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-14 23:27:01,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-14 23:27:01,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:02,393 INFO L225 Difference]: With dead ends: 6411 [2022-04-14 23:27:02,393 INFO L226 Difference]: Without dead ends: 6411 [2022-04-14 23:27:02,393 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:27:02,394 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:02,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-14 23:27:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-14 23:27:02,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:02,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 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:27:02,451 INFO L74 IsIncluded]: Start isIncluded. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 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:27:02,453 INFO L87 Difference]: Start difference. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 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:27:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:03,444 INFO L93 Difference]: Finished difference Result 6411 states and 8584 transitions. [2022-04-14 23:27:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8584 transitions. [2022-04-14 23:27:03,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:03,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:03,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 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 6411 states. [2022-04-14 23:27:03,459 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 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 6411 states. [2022-04-14 23:27:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:04,542 INFO L93 Difference]: Finished difference Result 6411 states and 8584 transitions. [2022-04-14 23:27:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8584 transitions. [2022-04-14 23:27:04,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:04,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:04,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:04,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.2950150789427) internal successors, (7300), 5637 states have internal predecessors, (7300), 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:27:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7303 transitions. [2022-04-14 23:27:05,311 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7303 transitions. Word has length 28 [2022-04-14 23:27:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:05,312 INFO L478 AbstractCegarLoop]: Abstraction has 5641 states and 7303 transitions. [2022-04-14 23:27:05,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7303 transitions. [2022-04-14 23:27:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:05,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:05,314 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:27:05,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-14 23:27:05,314 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1660978126, now seen corresponding path program 1 times [2022-04-14 23:27:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:05,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863825432] [2022-04-14 23:27:05,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:05,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:05,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {112582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {112576#true} is VALID [2022-04-14 23:27:05,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {112576#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112576#true} is VALID [2022-04-14 23:27:05,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112576#true} {112576#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112576#true} is VALID [2022-04-14 23:27:05,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {112576#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:05,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {112582#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {112576#true} is VALID [2022-04-14 23:27:05,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {112576#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112576#true} is VALID [2022-04-14 23:27:05,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112576#true} {112576#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112576#true} is VALID [2022-04-14 23:27:05,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {112576#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112576#true} is VALID [2022-04-14 23:27:05,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {112576#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {112576#true} is VALID [2022-04-14 23:27:05,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {112576#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {112576#true} is VALID [2022-04-14 23:27:05,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {112576#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {112576#true} is VALID [2022-04-14 23:27:05,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {112576#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {112576#true} is VALID [2022-04-14 23:27:05,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {112576#true} [219] L68-2-->L72-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[] {112576#true} is VALID [2022-04-14 23:27:05,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {112576#true} [221] L72-1-->L76-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[] {112576#true} is VALID [2022-04-14 23:27:05,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {112576#true} [223] L76-1-->L80-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[] {112576#true} is VALID [2022-04-14 23:27:05,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {112576#true} [225] L80-1-->L84-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[] {112576#true} is VALID [2022-04-14 23:27:05,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {112576#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {112576#true} is VALID [2022-04-14 23:27:05,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {112576#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {112576#true} is VALID [2022-04-14 23:27:05,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {112576#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {112581#(= main_~p8~0 0)} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {112581#(= main_~p8~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {112581#(= main_~p8~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {112581#(= main_~p8~0 0)} [241] L110-1-->L115-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[] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {112581#(= main_~p8~0 0)} [247] L115-1-->L120-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[] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {112581#(= main_~p8~0 0)} [251] L120-1-->L125-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[] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {112581#(= main_~p8~0 0)} [255] L125-1-->L130-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[] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {112581#(= main_~p8~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {112581#(= main_~p8~0 0)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {112581#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:05,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {112581#(= main_~p8~0 0)} [266] L140-1-->L146: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {112577#false} is VALID [2022-04-14 23:27:05,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {112577#false} [268] L146-->L156-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {112577#false} is VALID [2022-04-14 23:27:05,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {112577#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112577#false} is VALID [2022-04-14 23:27:05,352 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:27:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863825432] [2022-04-14 23:27:05,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863825432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:05,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:05,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171585688] [2022-04-14 23:27:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:05,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-14 23:27:05,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:05,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:05,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:05,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:05,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:05,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:05,367 INFO L87 Difference]: Start difference. First operand 5641 states and 7303 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:06,857 INFO L93 Difference]: Finished difference Result 7307 states and 9224 transitions. [2022-04-14 23:27:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:06,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-14 23:27:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-14 23:27:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-14 23:27:06,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-14 23:27:06,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:08,461 INFO L225 Difference]: With dead ends: 7307 [2022-04-14 23:27:08,461 INFO L226 Difference]: Without dead ends: 7307 [2022-04-14 23:27:08,462 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:27:08,462 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:08,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-14 23:27:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-14 23:27:08,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:08,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 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:27:08,530 INFO L74 IsIncluded]: Start isIncluded. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 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:27:08,534 INFO L87 Difference]: Start difference. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 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:27:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:09,781 INFO L93 Difference]: Finished difference Result 7307 states and 9224 transitions. [2022-04-14 23:27:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9224 transitions. [2022-04-14 23:27:09,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:09,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:09,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 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 7307 states. [2022-04-14 23:27:09,793 INFO L87 Difference]: Start difference. First operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 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 7307 states. [2022-04-14 23:27:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:11,157 INFO L93 Difference]: Finished difference Result 7307 states and 9224 transitions. [2022-04-14 23:27:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9224 transitions. [2022-04-14 23:27:11,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:11,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:11,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:11,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.2628407067524996) internal successors, (9220), 7301 states have internal predecessors, (9220), 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:27:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9223 transitions. [2022-04-14 23:27:12,560 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9223 transitions. Word has length 28 [2022-04-14 23:27:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:12,561 INFO L478 AbstractCegarLoop]: Abstraction has 7305 states and 9223 transitions. [2022-04-14 23:27:12,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:27:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9223 transitions. [2022-04-14 23:27:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:12,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:12,564 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:27:12,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-14 23:27:12,564 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:12,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:12,564 INFO L85 PathProgramCache]: Analyzing trace with hash 456305864, now seen corresponding path program 1 times [2022-04-14 23:27:12,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:12,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824751196] [2022-04-14 23:27:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:12,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:12,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {141820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {141814#true} is VALID [2022-04-14 23:27:12,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {141814#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141814#true} is VALID [2022-04-14 23:27:12,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141814#true} {141814#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {141814#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:12,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {141820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {141814#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141814#true} {141814#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {141814#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {141814#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {141814#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {141814#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {141814#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {141814#true} [219] L68-2-->L72-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[] {141814#true} is VALID [2022-04-14 23:27:12,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {141814#true} [221] L72-1-->L76-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[] {141814#true} is VALID [2022-04-14 23:27:12,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {141814#true} [223] L76-1-->L80-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[] {141814#true} is VALID [2022-04-14 23:27:12,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {141814#true} [225] L80-1-->L84-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[] {141814#true} is VALID [2022-04-14 23:27:12,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {141814#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {141814#true} is VALID [2022-04-14 23:27:12,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {141814#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {141814#true} is VALID [2022-04-14 23:27:12,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {141814#true} [230] L92-1-->L96-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {141819#(not (= main_~p8~0 0))} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {141819#(not (= main_~p8~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {141819#(not (= main_~p8~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {141819#(not (= main_~p8~0 0))} [241] L110-1-->L115-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[] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {141819#(not (= main_~p8~0 0))} [247] L115-1-->L120-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[] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {141819#(not (= main_~p8~0 0))} [251] L120-1-->L125-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[] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {141819#(not (= main_~p8~0 0))} [255] L125-1-->L130-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[] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {141819#(not (= main_~p8~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {141819#(not (= main_~p8~0 0))} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {141819#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:12,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {141819#(not (= main_~p8~0 0))} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {141815#false} is VALID [2022-04-14 23:27:12,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {141815#false} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {141815#false} is VALID [2022-04-14 23:27:12,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {141815#false} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {141815#false} is VALID [2022-04-14 23:27:12,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {141815#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141815#false} is VALID [2022-04-14 23:27:12,600 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:27:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:12,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824751196] [2022-04-14 23:27:12,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824751196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:12,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:12,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555170286] [2022-04-14 23:27:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:12,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-14 23:27:12,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:12,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:12,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:12,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:12,618 INFO L87 Difference]: Start difference. First operand 7305 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:14,193 INFO L93 Difference]: Finished difference Result 7435 states and 9224 transitions. [2022-04-14 23:27:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-14 23:27:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:27:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:27:14,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-14 23:27:14,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:15,832 INFO L225 Difference]: With dead ends: 7435 [2022-04-14 23:27:15,832 INFO L226 Difference]: Without dead ends: 7435 [2022-04-14 23:27:15,832 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:27:15,832 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:15,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-14 23:27:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-14 23:27:15,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:15,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 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:27:15,895 INFO L74 IsIncluded]: Start isIncluded. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 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:27:15,938 INFO L87 Difference]: Start difference. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 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:27:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,325 INFO L93 Difference]: Finished difference Result 7435 states and 9224 transitions. [2022-04-14 23:27:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9224 transitions. [2022-04-14 23:27:17,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:17,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:17,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 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 7435 states. [2022-04-14 23:27:17,338 INFO L87 Difference]: Start difference. First operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 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 7435 states. [2022-04-14 23:27:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:18,754 INFO L93 Difference]: Finished difference Result 7435 states and 9224 transitions. [2022-04-14 23:27:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9224 transitions. [2022-04-14 23:27:18,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:18,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:18,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:18,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2410822452550814) internal successors, (9220), 7429 states have internal predecessors, (9220), 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:27:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9223 transitions. [2022-04-14 23:27:20,108 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9223 transitions. Word has length 29 [2022-04-14 23:27:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:20,108 INFO L478 AbstractCegarLoop]: Abstraction has 7433 states and 9223 transitions. [2022-04-14 23:27:20,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9223 transitions. [2022-04-14 23:27:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:20,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:20,111 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:27:20,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-14 23:27:20,111 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash -49252761, now seen corresponding path program 1 times [2022-04-14 23:27:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331910426] [2022-04-14 23:27:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:20,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:20,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {171570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {171564#true} is VALID [2022-04-14 23:27:20,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {171564#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171564#true} {171564#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {171564#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:20,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {171570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {171564#true} is VALID [2022-04-14 23:27:20,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {171564#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171564#true} {171564#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {171564#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {171564#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {171564#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {171564#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {171564#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {171564#true} [219] L68-2-->L72-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[] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {171564#true} [221] L72-1-->L76-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[] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {171564#true} [223] L76-1-->L80-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[] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {171564#true} [225] L80-1-->L84-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[] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {171564#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {171564#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {171564#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {171564#true} is VALID [2022-04-14 23:27:20,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {171564#true} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {171569#(= main_~lk9~0 1)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {171569#(= main_~lk9~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {171569#(= main_~lk9~0 1)} [241] L110-1-->L115-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[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {171569#(= main_~lk9~0 1)} [247] L115-1-->L120-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[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {171569#(= main_~lk9~0 1)} [251] L120-1-->L125-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[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {171569#(= main_~lk9~0 1)} [255] L125-1-->L130-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[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {171569#(= main_~lk9~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {171569#(= main_~lk9~0 1)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {171569#(= main_~lk9~0 1)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {171569#(= main_~lk9~0 1)} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {171569#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:20,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {171569#(= main_~lk9~0 1)} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {171565#false} is VALID [2022-04-14 23:27:20,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {171565#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171565#false} is VALID [2022-04-14 23:27:20,139 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:27:20,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:20,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331910426] [2022-04-14 23:27:20,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331910426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:20,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:20,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:20,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134966971] [2022-04-14 23:27:20,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:20,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-14 23:27:20,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:20,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:20,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:20,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:20,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:20,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:20,154 INFO L87 Difference]: Start difference. First operand 7433 states and 9223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:24,299 INFO L93 Difference]: Finished difference Result 12299 states and 15112 transitions. [2022-04-14 23:27:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-14 23:27:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-04-14 23:27:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-04-14 23:27:24,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 98 transitions. [2022-04-14 23:27:24,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:28,877 INFO L225 Difference]: With dead ends: 12299 [2022-04-14 23:27:28,877 INFO L226 Difference]: Without dead ends: 12299 [2022-04-14 23:27:28,877 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:27:28,878 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:28,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-14 23:27:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-14 23:27:28,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:29,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 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:27:29,016 INFO L74 IsIncluded]: Start isIncluded. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 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:27:29,026 INFO L87 Difference]: Start difference. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 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:27:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,933 INFO L93 Difference]: Finished difference Result 12299 states and 15112 transitions. [2022-04-14 23:27:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15112 transitions. [2022-04-14 23:27:32,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:32,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:32,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 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 12299 states. [2022-04-14 23:27:32,960 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 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 12299 states. [2022-04-14 23:27:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:36,945 INFO L93 Difference]: Finished difference Result 12299 states and 15112 transitions. [2022-04-14 23:27:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15112 transitions. [2022-04-14 23:27:36,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:36,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:36,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:36,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2043659597124856) internal successors, (13572), 11269 states have internal predecessors, (13572), 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:27:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13575 transitions. [2022-04-14 23:27:40,478 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13575 transitions. Word has length 29 [2022-04-14 23:27:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:40,478 INFO L478 AbstractCegarLoop]: Abstraction has 11273 states and 13575 transitions. [2022-04-14 23:27:40,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13575 transitions. [2022-04-14 23:27:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:40,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:40,486 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:27:40,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-14 23:27:40,486 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash -342655768, now seen corresponding path program 1 times [2022-04-14 23:27:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:40,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871019655] [2022-04-14 23:27:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:40,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:40,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {219752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {219746#true} is VALID [2022-04-14 23:27:40,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {219746#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {219746#true} {219746#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {219746#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {219752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {219746#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219746#true} {219746#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {219746#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {219746#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {219746#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {219746#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {219746#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {219746#true} [219] L68-2-->L72-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[] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {219746#true} [221] L72-1-->L76-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[] {219746#true} is VALID [2022-04-14 23:27:40,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {219746#true} [223] L76-1-->L80-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[] {219746#true} is VALID [2022-04-14 23:27:40,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {219746#true} [225] L80-1-->L84-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[] {219746#true} is VALID [2022-04-14 23:27:40,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {219746#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {219746#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {219746#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {219746#true} is VALID [2022-04-14 23:27:40,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {219746#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {219751#(= main_~p9~0 0)} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {219751#(= main_~p9~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {219751#(= main_~p9~0 0)} [241] L110-1-->L115-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[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {219751#(= main_~p9~0 0)} [247] L115-1-->L120-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[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {219751#(= main_~p9~0 0)} [251] L120-1-->L125-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[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {219751#(= main_~p9~0 0)} [255] L125-1-->L130-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[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {219751#(= main_~p9~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {219751#(= main_~p9~0 0)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {219751#(= main_~p9~0 0)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {219751#(= main_~p9~0 0)} is VALID [2022-04-14 23:27:40,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {219751#(= main_~p9~0 0)} [270] L145-1-->L151: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {219747#false} is VALID [2022-04-14 23:27:40,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {219747#false} [272] L151-->L156-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {219747#false} is VALID [2022-04-14 23:27:40,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {219747#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219747#false} is VALID [2022-04-14 23:27:40,541 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:27:40,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:40,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871019655] [2022-04-14 23:27:40,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871019655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:40,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:40,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:40,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420104506] [2022-04-14 23:27:40,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-14 23:27:40,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:40,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:40,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:40,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:40,559 INFO L87 Difference]: Start difference. First operand 11273 states and 13575 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:45,318 INFO L93 Difference]: Finished difference Result 14347 states and 16648 transitions. [2022-04-14 23:27:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-14 23:27:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-04-14 23:27:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:27:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-04-14 23:27:45,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2022-04-14 23:27:45,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:50,671 INFO L225 Difference]: With dead ends: 14347 [2022-04-14 23:27:50,671 INFO L226 Difference]: Without dead ends: 14347 [2022-04-14 23:27:50,672 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:27:50,672 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:50,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-14 23:27:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-14 23:27:50,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:50,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 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:27:50,788 INFO L74 IsIncluded]: Start isIncluded. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 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:27:50,801 INFO L87 Difference]: Start difference. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 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:27:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:55,939 INFO L93 Difference]: Finished difference Result 14347 states and 16648 transitions. [2022-04-14 23:27:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 16648 transitions. [2022-04-14 23:27:55,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:55,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:55,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 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 14347 states. [2022-04-14 23:27:55,970 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 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 14347 states. [2022-04-14 23:28:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:00,681 INFO L93 Difference]: Finished difference Result 14347 states and 16648 transitions. [2022-04-14 23:28:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 16648 transitions. [2022-04-14 23:28:00,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:00,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:00,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:00,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1605885224182415) internal successors, (16644), 14341 states have internal predecessors, (16644), 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:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 16647 transitions. [2022-04-14 23:28:06,379 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 16647 transitions. Word has length 29 [2022-04-14 23:28:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:06,379 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 16647 transitions. [2022-04-14 23:28:06,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 16647 transitions. [2022-04-14 23:28:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:28:06,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:06,388 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:06,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-14 23:28:06,388 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1526802582, now seen corresponding path program 1 times [2022-04-14 23:28:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:06,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105191076] [2022-04-14 23:28:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:06,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:06,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {277150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {277144#true} is VALID [2022-04-14 23:28:06,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {277144#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {277144#true} {277144#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {277144#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:06,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {277150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {277144#true} is VALID [2022-04-14 23:28:06,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {277144#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277144#true} {277144#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {277144#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {277144#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {277144#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {277144#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {277144#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {277144#true} [219] L68-2-->L72-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[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {277144#true} [221] L72-1-->L76-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[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {277144#true} [223] L76-1-->L80-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[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {277144#true} [225] L80-1-->L84-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[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {277144#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {277144#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {277144#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {277144#true} is VALID [2022-04-14 23:28:06,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {277144#true} [232] L96-1-->L100-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {277149#(not (= main_~p9~0 0))} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {277149#(not (= main_~p9~0 0))} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {277149#(not (= main_~p9~0 0))} [241] L110-1-->L115-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[] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {277149#(not (= main_~p9~0 0))} [247] L115-1-->L120-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[] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {277149#(not (= main_~p9~0 0))} [251] L120-1-->L125-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[] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {277149#(not (= main_~p9~0 0))} [255] L125-1-->L130-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[] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {277149#(not (= main_~p9~0 0))} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {277149#(not (= main_~p9~0 0))} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {277149#(not (= main_~p9~0 0))} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {277149#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:28:06,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {277149#(not (= main_~p9~0 0))} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {277145#false} is VALID [2022-04-14 23:28:06,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {277145#false} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {277145#false} is VALID [2022-04-14 23:28:06,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {277145#false} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {277145#false} is VALID [2022-04-14 23:28:06,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {277145#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277145#false} is VALID [2022-04-14 23:28:06,415 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:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:06,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105191076] [2022-04-14 23:28:06,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105191076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:06,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:06,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787158589] [2022-04-14 23:28:06,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-14 23:28:06,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:06,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:06,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:06,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:06,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:06,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:06,431 INFO L87 Difference]: Start difference. First operand 14345 states and 16647 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:11,643 INFO L93 Difference]: Finished difference Result 14603 states and 16648 transitions. [2022-04-14 23:28:11,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:11,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-14 23:28:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-14 23:28:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-04-14 23:28:11,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-04-14 23:28:11,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:17,487 INFO L225 Difference]: With dead ends: 14603 [2022-04-14 23:28:17,487 INFO L226 Difference]: Without dead ends: 14603 [2022-04-14 23:28:17,488 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:17,488 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:17,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-14 23:28:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-14 23:28:17,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:17,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 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:17,618 INFO L74 IsIncluded]: Start isIncluded. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 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:17,631 INFO L87 Difference]: Start difference. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 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:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:22,692 INFO L93 Difference]: Finished difference Result 14603 states and 16648 transitions. [2022-04-14 23:28:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 16648 transitions. [2022-04-14 23:28:22,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:22,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:22,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 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 14603 states. [2022-04-14 23:28:22,721 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 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 14603 states. [2022-04-14 23:28:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:28,058 INFO L93 Difference]: Finished difference Result 14603 states and 16648 transitions. [2022-04-14 23:28:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 16648 transitions. [2022-04-14 23:28:28,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:28,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:28,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:28,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1402342947180928) internal successors, (16644), 14597 states have internal predecessors, (16644), 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:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16647 transitions. [2022-04-14 23:28:32,979 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16647 transitions. Word has length 30 [2022-04-14 23:28:32,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:32,979 INFO L478 AbstractCegarLoop]: Abstraction has 14601 states and 16647 transitions. [2022-04-14 23:28:32,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16647 transitions. [2022-04-14 23:28:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:28:32,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:32,984 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:28:32,984 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-14 23:28:32,984 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:32,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2032361207, now seen corresponding path program 1 times [2022-04-14 23:28:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:32,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850397076] [2022-04-14 23:28:32,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:32,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:33,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {335572#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {335566#true} is VALID [2022-04-14 23:28:33,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {335566#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {335566#true} {335566#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {335566#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335572#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:33,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {335572#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {335566#true} is VALID [2022-04-14 23:28:33,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {335566#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {335566#true} {335566#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {335566#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {335566#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {335566#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {335566#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {335566#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {335566#true} [219] L68-2-->L72-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[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {335566#true} [221] L72-1-->L76-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[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {335566#true} [223] L76-1-->L80-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[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {335566#true} [225] L80-1-->L84-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[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {335566#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {335566#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {335566#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {335566#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {335566#true} is VALID [2022-04-14 23:28:33,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {335566#true} [234] L100-1-->L104-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {335571#(= main_~lk10~0 1)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {335571#(= main_~lk10~0 1)} [241] L110-1-->L115-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[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {335571#(= main_~lk10~0 1)} [247] L115-1-->L120-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[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {335571#(= main_~lk10~0 1)} [251] L120-1-->L125-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[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {335571#(= main_~lk10~0 1)} [255] L125-1-->L130-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[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {335571#(= main_~lk10~0 1)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {335571#(= main_~lk10~0 1)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {335571#(= main_~lk10~0 1)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {335571#(= main_~lk10~0 1)} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {335571#(= main_~lk10~0 1)} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {335571#(= main_~lk10~0 1)} is VALID [2022-04-14 23:28:33,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {335571#(= main_~lk10~0 1)} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {335567#false} is VALID [2022-04-14 23:28:33,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {335567#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {335567#false} is VALID [2022-04-14 23:28:33,015 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:33,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:33,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850397076] [2022-04-14 23:28:33,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850397076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:33,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:33,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311452251] [2022-04-14 23:28:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-14 23:28:33,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:33,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:33,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:33,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:33,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:33,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:33,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:33,031 INFO L87 Difference]: Start difference. First operand 14601 states and 16647 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:46,584 INFO L93 Difference]: Finished difference Result 23561 states and 26119 transitions. [2022-04-14 23:28:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:46,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-14 23:28:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-14 23:28:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-14 23:28:46,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-14 23:28:46,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:01,784 INFO L225 Difference]: With dead ends: 23561 [2022-04-14 23:29:01,785 INFO L226 Difference]: Without dead ends: 23561 [2022-04-14 23:29:01,785 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:29:01,785 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:01,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 68 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23561 states. [2022-04-14 23:29:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23561 to 22537. [2022-04-14 23:29:01,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:01,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 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:29:01,998 INFO L74 IsIncluded]: Start isIncluded. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 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:29:02,020 INFO L87 Difference]: Start difference. First operand 23561 states. Second operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 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:29:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:15,543 INFO L93 Difference]: Finished difference Result 23561 states and 26119 transitions. [2022-04-14 23:29:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 26119 transitions. [2022-04-14 23:29:15,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:15,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:15,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 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 23561 states. [2022-04-14 23:29:15,640 INFO L87 Difference]: Start difference. First operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 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 23561 states. [2022-04-14 23:29:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:28,332 INFO L93 Difference]: Finished difference Result 23561 states and 26119 transitions. [2022-04-14 23:29:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 26119 transitions. [2022-04-14 23:29:28,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:28,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:28,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:28,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22537 states, 22533 states have (on average 1.1135667687391826) internal successors, (25092), 22533 states have internal predecessors, (25092), 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:29:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 25095 transitions. [2022-04-14 23:29:41,702 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 25095 transitions. Word has length 30 [2022-04-14 23:29:41,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:41,702 INFO L478 AbstractCegarLoop]: Abstraction has 22537 states and 25095 transitions. [2022-04-14 23:29:41,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:29:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 25095 transitions. [2022-04-14 23:29:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:29:41,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:41,712 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:29:41,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-14 23:29:41,713 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1969203082, now seen corresponding path program 1 times [2022-04-14 23:29:41,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:41,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844185362] [2022-04-14 23:29:41,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:41,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:41,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {428804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {428798#true} is VALID [2022-04-14 23:29:41,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {428798#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428798#true} {428798#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {428798#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {428804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (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] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {428798#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428798#true} {428798#true} [278] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {428798#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {428798#true} [207] mainENTRY-->L155-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_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~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_4, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~lk9~0=v_main_~lk9~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_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, 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_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {428798#true} [211] L155-1-->L43: Formula: (and (= |v_main_#t~nondet14_2| v_main_~cond~0_2) (<= |v_main_#t~nondet14_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648))) InVars {main_#t~nondet14=|v_main_#t~nondet14_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet14, main_~cond~0] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {428798#true} [214] L43-->L68: Formula: (and (= v_main_~lk4~0_2 0) (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk6~0_5 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_2, main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk4~0=v_main_~lk4~0_2, main_~lk6~0=v_main_~lk6~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk8~0=v_main_~lk8~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {428798#true} [217] L68-->L68-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {428798#true} [219] L68-2-->L72-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[] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {428798#true} [221] L72-1-->L76-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[] {428798#true} is VALID [2022-04-14 23:29:41,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {428798#true} [223] L76-1-->L80-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[] {428798#true} is VALID [2022-04-14 23:29:41,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {428798#true} [225] L80-1-->L84-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[] {428798#true} is VALID [2022-04-14 23:29:41,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {428798#true} [227] L84-1-->L88-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {428798#true} [229] L88-1-->L92-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {428798#true} [231] L92-1-->L96-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {428798#true} [233] L96-1-->L100-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {428798#true} is VALID [2022-04-14 23:29:41,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {428798#true} [235] L100-1-->L104-1: Formula: (= v_main_~p10~0_5 0) InVars {main_~p10~0=v_main_~p10~0_5} OutVars{main_~p10~0=v_main_~p10~0_5} AuxVars[] AssignedVars[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {428803#(= main_~p10~0 0)} [237] L104-1-->L110-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {428803#(= main_~p10~0 0)} [241] L110-1-->L115-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[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {428803#(= main_~p10~0 0)} [247] L115-1-->L120-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[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {428803#(= main_~p10~0 0)} [251] L120-1-->L125-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[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {428803#(= main_~p10~0 0)} [255] L125-1-->L130-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[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {428803#(= main_~p10~0 0)} [259] L130-1-->L135-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {428803#(= main_~p10~0 0)} [263] L135-1-->L140-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {428803#(= main_~p10~0 0)} [267] L140-1-->L145-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {428803#(= main_~p10~0 0)} [271] L145-1-->L150-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {428803#(= main_~p10~0 0)} is VALID [2022-04-14 23:29:41,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {428803#(= main_~p10~0 0)} [274] L150-1-->L156: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {428799#false} is VALID [2022-04-14 23:29:41,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {428799#false} [276] L156-->L156-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {428799#false} is VALID [2022-04-14 23:29:41,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {428799#false} [242] L156-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428799#false} is VALID [2022-04-14 23:29:41,755 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:29:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:41,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844185362] [2022-04-14 23:29:41,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844185362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:41,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:41,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:41,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415548658] [2022-04-14 23:29:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:41,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-14 23:29:41,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:41,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:29:41,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:41,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:41,771 INFO L87 Difference]: Start difference. First operand 22537 states and 25095 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:30:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:02,944 INFO L93 Difference]: Finished difference Result 28167 states and 29702 transitions. [2022-04-14 23:30:02,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:30:02,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-14 23:30:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:30:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:30:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-14 23:30:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:30:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-14 23:30:02,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-14 23:30:03,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:30:03,022 INFO L225 Difference]: With dead ends: 28167 [2022-04-14 23:30:03,022 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 23:30:03,022 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:30:03,023 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:30:03,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 112 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:30:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 23:30:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 23:30:03,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:30:03,023 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:30:03,023 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:30:03,024 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:30:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:03,024 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:30:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:30:03,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:03,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:03,024 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:30:03,024 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:30:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:03,024 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 23:30:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:30:03,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:03,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:03,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:30:03,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:30:03,024 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:30:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 23:30:03,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-14 23:30:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:30:03,025 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 23:30:03,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:30:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 23:30:03,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:03,028 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 23:30:03,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-14 23:30:03,032 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:30:03,036 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 23:30:03,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:30:03 BasicIcfg [2022-04-14 23:30:03,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 23:30:03,039 INFO L158 Benchmark]: Toolchain (without parser) took 197357.79ms. Allocated memory was 198.2MB in the beginning and 464.5MB in the end (delta: 266.3MB). Free memory was 146.0MB in the beginning and 150.8MB in the end (delta: -4.8MB). Peak memory consumption was 261.6MB. Max. memory is 8.0GB. [2022-04-14 23:30:03,039 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 23:30:03,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.51ms. Allocated memory was 198.2MB in the beginning and 267.4MB in the end (delta: 69.2MB). Free memory was 145.8MB in the beginning and 241.4MB in the end (delta: -95.5MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-14 23:30:03,039 INFO L158 Benchmark]: Boogie Preprocessor took 37.45ms. Allocated memory is still 267.4MB. Free memory was 241.4MB in the beginning and 239.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 23:30:03,041 INFO L158 Benchmark]: RCFGBuilder took 354.62ms. Allocated memory is still 267.4MB. Free memory was 239.8MB in the beginning and 224.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-14 23:30:03,041 INFO L158 Benchmark]: IcfgTransformer took 45.33ms. Allocated memory is still 267.4MB. Free memory was 224.6MB in the beginning and 222.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-14 23:30:03,041 INFO L158 Benchmark]: TraceAbstraction took 196688.14ms. Allocated memory was 267.4MB in the beginning and 464.5MB in the end (delta: 197.1MB). Free memory was 221.4MB in the beginning and 150.8MB in the end (delta: 70.6MB). Peak memory consumption was 268.8MB. Max. memory is 8.0GB. [2022-04-14 23:30:03,046 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 198.2MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.51ms. Allocated memory was 198.2MB in the beginning and 267.4MB in the end (delta: 69.2MB). Free memory was 145.8MB in the beginning and 241.4MB in the end (delta: -95.5MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.45ms. Allocated memory is still 267.4MB. Free memory was 241.4MB in the beginning and 239.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 354.62ms. Allocated memory is still 267.4MB. Free memory was 239.8MB in the beginning and 224.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 45.33ms. Allocated memory is still 267.4MB. Free memory was 224.6MB in the beginning and 222.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 196688.14ms. Allocated memory was 267.4MB in the beginning and 464.5MB in the end (delta: 197.1MB). Free memory was 221.4MB in the beginning and 150.8MB in the end (delta: 70.6MB). Peak memory consumption was 268.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 163]: 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 196.7s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 96.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3720 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3720 mSDsluCounter, 2693 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 2488 mSDtfsCounter, 1747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22537occurred in iteration=28, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 98.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 4126 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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:30:03,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...