/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/openssl-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 20:27:57,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 20:27:57,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 20:27:57,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 20:27:57,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 20:27:57,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 20:27:57,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 20:27:57,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 20:27:57,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 20:27:57,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 20:27:57,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 20:27:57,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 20:27:57,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 20:27:57,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 20:27:57,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 20:27:57,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 20:27:57,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 20:27:57,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 20:27:57,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 20:27:57,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 20:27:57,645 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 20:27:57,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 20:27:57,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 20:27:57,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 20:27:57,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 20:27:57,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 20:27:57,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 20:27:57,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 20:27:57,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 20:27:57,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 20:27:57,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 20:27:57,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 20:27:57,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 20:27:57,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 20:27:57,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 20:27:57,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 20:27:57,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 20:27:57,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 20:27:57,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 20:27:57,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 20:27:57,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 20:27:57,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 20:27:57,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 20:27:57,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 20:27:57,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 20:27:57,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 20:27:57,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 20:27:57,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 20:27:57,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 20:27:57,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 20:27:57,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 20:27:57,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 20:27:57,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 20:27:57,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 20:27:57,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 20:27:57,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 20:27:57,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 20:27:57,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 20:27:57,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 20:27:57,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 20:27:57,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 20:27:57,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:27:57,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 20:27:57,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 20:27:57,683 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 20:27:57,683 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-27 20:27:57,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 20:27:57,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 20:27:57,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 20:27:57,962 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 20:27:57,962 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 20:27:57,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-27 20:27:58,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863c8f8f9/25a7991cae94485897604e874c740b7e/FLAG258028116 [2022-04-27 20:27:58,405 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 20:27:58,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-27 20:27:58,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863c8f8f9/25a7991cae94485897604e874c740b7e/FLAG258028116 [2022-04-27 20:27:58,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863c8f8f9/25a7991cae94485897604e874c740b7e [2022-04-27 20:27:58,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 20:27:58,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 20:27:58,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 20:27:58,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 20:27:58,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 20:27:58,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:27:58" (1/1) ... [2022-04-27 20:27:58,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f10fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:58, skipping insertion in model container [2022-04-27 20:27:58,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:27:58" (1/1) ... [2022-04-27 20:27:58,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 20:27:58,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 20:27:59,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-04-27 20:27:59,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:27:59,086 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 20:27:59,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-04-27 20:27:59,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:27:59,127 INFO L208 MainTranslator]: Completed translation [2022-04-27 20:27:59,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59 WrapperNode [2022-04-27 20:27:59,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 20:27:59,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 20:27:59,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 20:27:59,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 20:27:59,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 20:27:59,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 20:27:59,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 20:27:59,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 20:27:59,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:27:59,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:27:59,221 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-27 20:27:59,244 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-27 20:27:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 20:27:59,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 20:27:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 20:27:59,269 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 20:27:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 20:27:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 20:27:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 20:27:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 20:27:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 20:27:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 20:27:59,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 20:27:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 20:27:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 20:27:59,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 20:27:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 20:27:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 20:27:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 20:27:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 20:27:59,328 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 20:27:59,329 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 20:27:59,505 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 20:27:59,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 20:27:59,510 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 20:27:59,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:27:59 BoogieIcfgContainer [2022-04-27 20:27:59,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 20:27:59,512 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 20:27:59,513 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 20:27:59,513 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 20:27:59,516 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:27:59" (1/1) ... [2022-04-27 20:27:59,518 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 20:27:59,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:27:59 BasicIcfg [2022-04-27 20:27:59,540 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 20:27:59,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 20:27:59,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 20:27:59,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 20:27:59,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 08:27:58" (1/4) ... [2022-04-27 20:27:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d67a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:27:59, skipping insertion in model container [2022-04-27 20:27:59,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:27:59" (2/4) ... [2022-04-27 20:27:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d67a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:27:59, skipping insertion in model container [2022-04-27 20:27:59,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:27:59" (3/4) ... [2022-04-27 20:27:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d67a003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:27:59, skipping insertion in model container [2022-04-27 20:27:59,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:27:59" (4/4) ... [2022-04-27 20:27:59,547 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.cJordan [2022-04-27 20:27:59,588 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 20:27:59,588 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 20:27:59,637 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 20:27:59,642 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23fb11ad, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15f44d50 [2022-04-27 20:27:59,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 20:27:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 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-27 20:27:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 20:27:59,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:27:59,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:27:59,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:27:59,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:27:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash 472059503, now seen corresponding path program 1 times [2022-04-27 20:27:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:27:59,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91717106] [2022-04-27 20:27:59,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:27:59,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:27:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:27:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:27:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:27:59,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 20:27:59,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:27:59,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:27:59,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:27:59,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 20:27:59,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:27:59,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:27:59,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:27:59,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {37#(= main_~blastFlag~0 0)} is VALID [2022-04-27 20:27:59,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~blastFlag~0 0)} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#(= main_~blastFlag~0 0)} is VALID [2022-04-27 20:27:59,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#(= main_~blastFlag~0 0)} [121] L30-->L108: Formula: (and (< 2 v_main_~blastFlag~0_6) (<= v_main_~s__state~0_5 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:27:59,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:27:59,923 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-27 20:27:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:27:59,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91717106] [2022-04-27 20:27:59,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91717106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:27:59,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:27:59,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:27:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006200981] [2022-04-27 20:27:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:27:59,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 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 9 [2022-04-27 20:27:59,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:27:59,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:27:59,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:27:59,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:27:59,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:27:59,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:27:59,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:27:59,985 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 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 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:00,267 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-04-27 20:28:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:28:00,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 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 9 [2022-04-27 20:28:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:28:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-27 20:28:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-27 20:28:00,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2022-04-27 20:28:00,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:00,407 INFO L225 Difference]: With dead ends: 47 [2022-04-27 20:28:00,407 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 20:28:00,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 20:28:00,412 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:28:00,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 44 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:28:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 20:28:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 20:28:00,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:28:00,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,446 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,446 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:00,450 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-27 20:28:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-27 20:28:00,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:00,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:00,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 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 39 states. [2022-04-27 20:28:00,452 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 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 39 states. [2022-04-27 20:28:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:00,455 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-27 20:28:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-27 20:28:00,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:00,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:00,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:28:00,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:28:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-27 20:28:00,460 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 9 [2022-04-27 20:28:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:28:00,460 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-04-27 20:28:00,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-27 20:28:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 20:28:00,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:28:00,462 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:28:00,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 20:28:00,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:28:00,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:28:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash -493282618, now seen corresponding path program 1 times [2022-04-27 20:28:00,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:28:00,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082416696] [2022-04-27 20:28:00,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:28:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:28:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:28:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:00,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {207#true} is VALID [2022-04-27 20:28:00,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 20:28:00,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 20:28:00,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {207#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:28:00,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {207#true} is VALID [2022-04-27 20:28:00,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {207#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 20:28:00,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207#true} {207#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 20:28:00,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {207#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 20:28:00,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {207#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {207#true} is VALID [2022-04-27 20:28:00,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 20:28:00,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 20:28:00,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-27 20:28:00,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {207#true} is VALID [2022-04-27 20:28:00,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#true} [132] L69-1-->L111: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_16 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_16, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {212#(<= 8656 main_~s__state~0)} is VALID [2022-04-27 20:28:00,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(<= 8656 main_~s__state~0)} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#(<= 8656 main_~s__state~0)} is VALID [2022-04-27 20:28:00,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#(<= 8656 main_~s__state~0)} [121] L30-->L108: Formula: (and (< 2 v_main_~blastFlag~0_6) (<= v_main_~s__state~0_5 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} AuxVars[] AssignedVars[] {208#false} is VALID [2022-04-27 20:28:00,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {208#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#false} is VALID [2022-04-27 20:28:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:28:00,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:28:00,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082416696] [2022-04-27 20:28:00,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082416696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:28:00,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:28:00,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:28:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682883340] [2022-04-27 20:28:00,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:28:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-27 20:28:00,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:28:00,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:00,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:28:00,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:28:00,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:28:00,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:28:00,535 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:00,654 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-04-27 20:28:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:28:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-27 20:28:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:28:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 20:28:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 20:28:00,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-27 20:28:00,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:00,709 INFO L225 Difference]: With dead ends: 53 [2022-04-27 20:28:00,709 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 20:28:00,710 INFO L412 NwaCegarLoop]: 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-27 20:28:00,713 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:28:00,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 43 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:28:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 20:28:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2022-04-27 20:28:00,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:28:00,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,725 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,727 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:00,737 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-04-27 20:28:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-04-27 20:28:00,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:00,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:00,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 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 53 states. [2022-04-27 20:28:00,738 INFO L87 Difference]: Start difference. First operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 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 53 states. [2022-04-27 20:28:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:00,741 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-04-27 20:28:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-04-27 20:28:00,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:00,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:00,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:28:00,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:28:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-27 20:28:00,744 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 14 [2022-04-27 20:28:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:28:00,744 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-04-27 20:28:00,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-27 20:28:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 20:28:00,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:28:00,745 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:28:00,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 20:28:00,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:28:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:28:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash -493252827, now seen corresponding path program 1 times [2022-04-27 20:28:00,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:28:00,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389334567] [2022-04-27 20:28:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:28:00,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:28:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:28:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:00,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {427#true} is VALID [2022-04-27 20:28:00,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-27 20:28:00,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {427#true} {427#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-27 20:28:00,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {427#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:28:00,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {427#true} is VALID [2022-04-27 20:28:00,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-27 20:28:00,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-27 20:28:00,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {427#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-27 20:28:00,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {427#true} is VALID [2022-04-27 20:28:00,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-27 20:28:00,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {427#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-27 20:28:00,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {427#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-27 20:28:00,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {427#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {432#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 20:28:00,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {432#(= (+ (- 2) main_~blastFlag~0) 0)} [133] L69-1-->L111: Formula: (and (= v_main_~s__state~0_17 8512) (= v_main_~s__hit~0_7 0)) InVars {main_~s__hit~0=v_main_~s__hit~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_17, main_~s__hit~0=v_main_~s__hit~0_7} AuxVars[] AssignedVars[main_~s__state~0] {432#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 20:28:00,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#(= (+ (- 2) main_~blastFlag~0) 0)} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 20:28:00,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#(= (+ (- 2) main_~blastFlag~0) 0)} [121] L30-->L108: Formula: (and (< 2 v_main_~blastFlag~0_6) (<= v_main_~s__state~0_5 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-27 20:28:00,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-27 20:28:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:28:00,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:28:00,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389334567] [2022-04-27 20:28:00,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389334567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:28:00,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:28:00,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:28:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426804408] [2022-04-27 20:28:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:28:00,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-27 20:28:00,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:28:00,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:00,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:28:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:28:00,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:28:00,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:28:00,877 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:00,998 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-27 20:28:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:28:00,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2022-04-27 20:28:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:28:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 20:28:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 20:28:01,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-27 20:28:01,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:01,076 INFO L225 Difference]: With dead ends: 67 [2022-04-27 20:28:01,076 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 20:28:01,076 INFO L412 NwaCegarLoop]: 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-27 20:28:01,077 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:28:01,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:28:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 20:28:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 20:28:01,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:28:01,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,085 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,086 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:01,093 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-27 20:28:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-27 20:28:01,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:01,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:01,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 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 67 states. [2022-04-27 20:28:01,095 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 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 67 states. [2022-04-27 20:28:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:01,098 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-27 20:28:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-27 20:28:01,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:01,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:01,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:28:01,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:28:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-27 20:28:01,101 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 14 [2022-04-27 20:28:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:28:01,103 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-27 20:28:01,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-27 20:28:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 20:28:01,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:28:01,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:28:01,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 20:28:01,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:28:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:28:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1278160632, now seen corresponding path program 1 times [2022-04-27 20:28:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:28:01,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154965848] [2022-04-27 20:28:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:28:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:28:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:28:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:01,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {707#true} is VALID [2022-04-27 20:28:01,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {707#true} {707#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:28:01,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {707#true} is VALID [2022-04-27 20:28:01,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {707#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {707#true} is VALID [2022-04-27 20:28:01,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {707#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {707#true} is VALID [2022-04-27 20:28:01,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {707#true} [132] L69-1-->L111: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_16 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_16, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {707#true} is VALID [2022-04-27 20:28:01,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {707#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {707#true} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#true} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#true} [136] L57-->L61: Formula: (not (= v_main_~s__state~0_13 8640)) InVars {main_~s__state~0=v_main_~s__state~0_13} OutVars{main_~s__state~0=v_main_~s__state~0_13} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#true} [141] L61-->L62: Formula: (= v_main_~s__state~0_14 8656) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {707#true} is VALID [2022-04-27 20:28:01,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {707#true} [145] L62-->L100-1: Formula: (and (= v_main_~blastFlag~0_4 2) (= v_main_~blastFlag~0_3 3)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3} AuxVars[] AssignedVars[main_~blastFlag~0] {712#(= 3 main_~blastFlag~0)} is VALID [2022-04-27 20:28:01,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#(= 3 main_~blastFlag~0)} [148] L100-1-->L107: Formula: (not (= v_main_~blastFlag~0_10 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_10} AuxVars[] AssignedVars[] {712#(= 3 main_~blastFlag~0)} is VALID [2022-04-27 20:28:01,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {712#(= 3 main_~blastFlag~0)} [151] L107-->L108: Formula: (= 5 v_main_~blastFlag~0_11) InVars {main_~blastFlag~0=v_main_~blastFlag~0_11} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_11} AuxVars[] AssignedVars[] {708#false} is VALID [2022-04-27 20:28:01,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {708#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {708#false} is VALID [2022-04-27 20:28:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 20:28:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:28:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154965848] [2022-04-27 20:28:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154965848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:28:01,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:28:01,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:28:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264818051] [2022-04-27 20:28:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:28:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 20:28:01,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:28:01,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:01,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:28:01,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:28:01,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:28:01,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:28:01,253 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:01,394 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-04-27 20:28:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:28:01,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 20:28:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:28:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 20:28:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 20:28:01,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-27 20:28:01,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:01,477 INFO L225 Difference]: With dead ends: 89 [2022-04-27 20:28:01,477 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 20:28:01,477 INFO L412 NwaCegarLoop]: 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-27 20:28:01,478 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:28:01,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 53 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:28:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 20:28:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-27 20:28:01,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:28:01,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,484 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,484 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:01,487 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-04-27 20:28:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-04-27 20:28:01,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:01,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:01,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-27 20:28:01,489 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-27 20:28:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:01,491 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-04-27 20:28:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-04-27 20:28:01,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:01,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:01,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:28:01,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:28:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-04-27 20:28:01,500 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 21 [2022-04-27 20:28:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:28:01,500 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-04-27 20:28:01,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-27 20:28:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 20:28:01,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:28:01,506 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:28:01,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 20:28:01,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:28:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:28:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1498444954, now seen corresponding path program 1 times [2022-04-27 20:28:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:28:01,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259534257] [2022-04-27 20:28:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:28:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:28:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:28:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:01,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {1079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1073#true} is VALID [2022-04-27 20:28:01,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1073#true} {1073#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:28:01,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1073#true} is VALID [2022-04-27 20:28:01,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {1073#true} is VALID [2022-04-27 20:28:01,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {1073#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {1073#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {1073#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {1073#true} is VALID [2022-04-27 20:28:01,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {1073#true} [132] L69-1-->L111: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_16 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_16, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {1073#true} is VALID [2022-04-27 20:28:01,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {1073#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {1073#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {1073#true} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#true} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {1073#true} [136] L57-->L61: Formula: (not (= v_main_~s__state~0_13 8640)) InVars {main_~s__state~0=v_main_~s__state~0_13} OutVars{main_~s__state~0=v_main_~s__state~0_13} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {1073#true} [141] L61-->L62: Formula: (= v_main_~s__state~0_14 8656) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {1073#true} [145] L62-->L100-1: Formula: (and (= v_main_~blastFlag~0_4 2) (= v_main_~blastFlag~0_3 3)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3} AuxVars[] AssignedVars[main_~blastFlag~0] {1073#true} is VALID [2022-04-27 20:28:01,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {1073#true} [148] L100-1-->L107: Formula: (not (= v_main_~blastFlag~0_10 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_10} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {1073#true} [152] L107-->L104-1: Formula: (not (= 5 v_main_~blastFlag~0_12)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_12} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_12} AuxVars[] AssignedVars[] {1073#true} is VALID [2022-04-27 20:28:01,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {1073#true} [149] L104-1-->L111: Formula: (and (= v_main_~s__state~0_11 8640) (not (= v_main_~s__hit~0_4 0))) InVars {main_~s__hit~0=v_main_~s__hit~0_4} OutVars{main_~s__state~0=v_main_~s__state~0_11, main_~s__hit~0=v_main_~s__hit~0_4} AuxVars[] AssignedVars[main_~s__state~0] {1078#(<= 8640 main_~s__state~0)} is VALID [2022-04-27 20:28:01,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {1078#(<= 8640 main_~s__state~0)} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1078#(<= 8640 main_~s__state~0)} is VALID [2022-04-27 20:28:01,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {1078#(<= 8640 main_~s__state~0)} [121] L30-->L108: Formula: (and (< 2 v_main_~blastFlag~0_6) (<= v_main_~s__state~0_5 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} AuxVars[] AssignedVars[] {1074#false} is VALID [2022-04-27 20:28:01,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {1074#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#false} is VALID [2022-04-27 20:28:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 20:28:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:28:01,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259534257] [2022-04-27 20:28:01,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259534257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:28:01,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:28:01,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:28:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869348818] [2022-04-27 20:28:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:28:01,608 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 24 [2022-04-27 20:28:01,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:28:01,609 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-27 20:28:01,628 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-27 20:28:01,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:28:01,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:28:01,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:28:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:28:01,630 INFO L87 Difference]: Start difference. First operand 87 states and 112 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-27 20:28:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:01,731 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2022-04-27 20:28:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:28:01,732 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 24 [2022-04-27 20:28:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:28:01,732 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-27 20:28:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-27 20:28:01,736 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-27 20:28:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-27 20:28:01,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-27 20:28:01,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:01,796 INFO L225 Difference]: With dead ends: 86 [2022-04-27 20:28:01,796 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 20:28:01,797 INFO L412 NwaCegarLoop]: 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-27 20:28:01,805 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:28:01,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 41 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:28:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 20:28:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-27 20:28:01,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:28:01,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,818 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,819 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:01,824 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 20:28:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 20:28:01,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:01,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:01,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 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 67 states. [2022-04-27 20:28:01,827 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 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 67 states. [2022-04-27 20:28:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:01,834 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 20:28:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 20:28:01,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:01,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:01,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:28:01,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:28:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-27 20:28:01,838 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 24 [2022-04-27 20:28:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:28:01,838 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-27 20:28:01,838 INFO L496 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-27 20:28:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-27 20:28:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 20:28:01,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:28:01,839 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:28:01,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 20:28:01,840 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:28:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:28:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1101537560, now seen corresponding path program 1 times [2022-04-27 20:28:01,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:28:01,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819150407] [2022-04-27 20:28:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:28:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:28:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:28:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:28:01,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {1376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1370#true} is VALID [2022-04-27 20:28:01,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1370#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1370#true} is VALID [2022-04-27 20:28:01,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1370#true} {1370#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1370#true} is VALID [2022-04-27 20:28:01,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {1370#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:28:01,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1370#true} is VALID [2022-04-27 20:28:01,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {1370#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1370#true} is VALID [2022-04-27 20:28:01,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1370#true} {1370#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1370#true} is VALID [2022-04-27 20:28:01,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {1370#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1370#true} is VALID [2022-04-27 20:28:01,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {1370#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {1370#true} is VALID [2022-04-27 20:28:01,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {1370#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1370#true} is VALID [2022-04-27 20:28:01,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {1370#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1370#true} is VALID [2022-04-27 20:28:01,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {1370#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {1370#true} is VALID [2022-04-27 20:28:01,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {1370#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {1370#true} is VALID [2022-04-27 20:28:01,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {1370#true} [132] L69-1-->L111: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_16 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_16, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {1375#(not (= main_~s__hit~0 0))} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {1375#(not (= main_~s__hit~0 0))} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {1375#(not (= main_~s__hit~0 0))} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(not (= main_~s__hit~0 0))} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {1375#(not (= main_~s__hit~0 0))} [136] L57-->L61: Formula: (not (= v_main_~s__state~0_13 8640)) InVars {main_~s__state~0=v_main_~s__state~0_13} OutVars{main_~s__state~0=v_main_~s__state~0_13} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {1375#(not (= main_~s__hit~0 0))} [141] L61-->L62: Formula: (= v_main_~s__state~0_14 8656) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {1375#(not (= main_~s__hit~0 0))} [145] L62-->L100-1: Formula: (and (= v_main_~blastFlag~0_4 2) (= v_main_~blastFlag~0_3 3)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3} AuxVars[] AssignedVars[main_~blastFlag~0] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {1375#(not (= main_~s__hit~0 0))} [148] L100-1-->L107: Formula: (not (= v_main_~blastFlag~0_10 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_10} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {1375#(not (= main_~s__hit~0 0))} [152] L107-->L104-1: Formula: (not (= 5 v_main_~blastFlag~0_12)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_12} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_12} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {1375#(not (= main_~s__hit~0 0))} [149] L104-1-->L111: Formula: (and (= v_main_~s__state~0_11 8640) (not (= v_main_~s__hit~0_4 0))) InVars {main_~s__hit~0=v_main_~s__hit~0_4} OutVars{main_~s__state~0=v_main_~s__state~0_11, main_~s__hit~0=v_main_~s__hit~0_4} AuxVars[] AssignedVars[main_~s__state~0] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {1375#(not (= main_~s__hit~0 0))} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {1375#(not (= main_~s__hit~0 0))} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {1375#(not (= main_~s__hit~0 0))} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {1375#(not (= main_~s__hit~0 0))} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {1375#(not (= main_~s__hit~0 0))} [135] L57-->L58: Formula: (= v_main_~s__state~0_12 8640) InVars {main_~s__state~0=v_main_~s__state~0_12} OutVars{main_~s__state~0=v_main_~s__state~0_12} AuxVars[] AssignedVars[] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {1375#(not (= main_~s__hit~0 0))} [139] L58-->L89-1: Formula: (and (= 3 v_main_~blastFlag~0_17) (= v_main_~blastFlag~0_16 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_17} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_16} AuxVars[] AssignedVars[main_~blastFlag~0] {1375#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 20:28:01,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {1375#(not (= main_~s__hit~0 0))} [144] L89-1-->L111: Formula: (and (= v_main_~s__hit~0_3 0) (= v_main_~s__state~0_4 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_3} OutVars{main_~s__state~0=v_main_~s__state~0_4, main_~s__hit~0=v_main_~s__hit~0_3} AuxVars[] AssignedVars[main_~s__state~0] {1371#false} is VALID [2022-04-27 20:28:01,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {1371#false} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {1371#false} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {1371#false} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {1371#false} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {1371#false} [136] L57-->L61: Formula: (not (= v_main_~s__state~0_13 8640)) InVars {main_~s__state~0=v_main_~s__state~0_13} OutVars{main_~s__state~0=v_main_~s__state~0_13} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {1371#false} [141] L61-->L62: Formula: (= v_main_~s__state~0_14 8656) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {1371#false} [146] L62-->L100-1: Formula: (not (= v_main_~blastFlag~0_5 2)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_5} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {1371#false} [148] L100-1-->L107: Formula: (not (= v_main_~blastFlag~0_10 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_10} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {1371#false} [151] L107-->L108: Formula: (= 5 v_main_~blastFlag~0_11) InVars {main_~blastFlag~0=v_main_~blastFlag~0_11} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_11} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {1371#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1371#false} is VALID [2022-04-27 20:28:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 20:28:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:28:01,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819150407] [2022-04-27 20:28:01,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819150407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:28:01,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:28:01,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:28:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785193053] [2022-04-27 20:28:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:28:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 38 [2022-04-27 20:28:01,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:28:01,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:01,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:01,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:28:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:28:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:28:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:28:01,971 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:02,058 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-27 20:28:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:28:02,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 38 [2022-04-27 20:28:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:28:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 20:28:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:02,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 20:28:02,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-27 20:28:02,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:28:02,096 INFO L225 Difference]: With dead ends: 57 [2022-04-27 20:28:02,096 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 20:28:02,096 INFO L412 NwaCegarLoop]: 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-27 20:28:02,100 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:28:02,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:28:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 20:28:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 20:28:02,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:28:02,103 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-27 20:28:02,103 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-27 20:28:02,103 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-27 20:28:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:02,103 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:28:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:28:02,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:02,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:02,104 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-27 20:28:02,104 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-27 20:28:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:28:02,104 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 20:28:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:28:02,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:02,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:28:02,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:28:02,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:28:02,104 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-27 20:28:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 20:28:02,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-27 20:28:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:28:02,105 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 20:28:02,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:28:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 20:28:02,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:28:02,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 20:28:02,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 20:28:02,112 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 20:28:02,117 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 20:28:02,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:28:02 BasicIcfg [2022-04-27 20:28:02,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 20:28:02,123 INFO L158 Benchmark]: Toolchain (without parser) took 3289.72ms. Allocated memory was 185.6MB in the beginning and 282.1MB in the end (delta: 96.5MB). Free memory was 130.2MB in the beginning and 245.1MB in the end (delta: -114.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:28:02,123 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:28:02,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.46ms. Allocated memory was 185.6MB in the beginning and 282.1MB in the end (delta: 96.5MB). Free memory was 130.0MB in the beginning and 255.1MB in the end (delta: -125.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-27 20:28:02,124 INFO L158 Benchmark]: Boogie Preprocessor took 48.23ms. Allocated memory is still 282.1MB. Free memory was 255.1MB in the beginning and 253.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 20:28:02,124 INFO L158 Benchmark]: RCFGBuilder took 333.95ms. Allocated memory is still 282.1MB. Free memory was 253.5MB in the beginning and 240.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 20:28:02,124 INFO L158 Benchmark]: IcfgTransformer took 27.95ms. Allocated memory is still 282.1MB. Free memory was 240.9MB in the beginning and 239.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 20:28:02,125 INFO L158 Benchmark]: TraceAbstraction took 2580.33ms. Allocated memory is still 282.1MB. Free memory was 238.8MB in the beginning and 245.1MB in the end (delta: -6.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:28:02,126 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.12ms. Allocated memory is still 185.6MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.46ms. Allocated memory was 185.6MB in the beginning and 282.1MB in the end (delta: 96.5MB). Free memory was 130.0MB in the beginning and 255.1MB in the end (delta: -125.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.23ms. Allocated memory is still 282.1MB. Free memory was 255.1MB in the beginning and 253.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 333.95ms. Allocated memory is still 282.1MB. Free memory was 253.5MB in the beginning and 240.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 27.95ms. Allocated memory is still 282.1MB. Free memory was 240.9MB in the beginning and 239.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2580.33ms. Allocated memory is still 282.1MB. Free memory was 238.8MB in the beginning and 245.1MB in the end (delta: -6.2MB). There was no memory consumed. 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: 150]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 228 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 42/42 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-27 20:28:02,167 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...