/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/loop-invgen/id_build.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:02:49,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:02:49,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:02:49,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:02:49,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:02:49,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:02:49,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:02:49,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:02:49,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:02:49,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:02:49,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:02:49,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:02:49,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:02:49,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:02:49,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:02:49,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:02:49,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:02:49,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:02:49,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:02:49,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:02:49,081 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:02:49,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:02:49,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:02:49,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:02:49,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:02:49,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:02:49,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:02:49,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:02:49,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:02:49,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:02:49,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:02:49,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:02:49,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:02:49,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:02:49,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:02:49,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:02:49,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:02:49,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:02:49,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:02:49,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:02:49,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:02:49,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:02:49,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:02:49,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:02:49,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:02:49,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:02:49,105 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:02:49,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:02:49,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:02:49,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:02:49,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:02:49,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:02:49,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:02:49,106 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:02:49,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:02:49,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:02:49,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:02:49,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:02:49,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:02:49,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:02:49,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:02:49,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:02:49,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:02:49,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:02:49,108 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:02:49,108 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 17:02:49,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:02:49,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:02:49,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:02:49,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:02:49,364 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:02:49,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c [2022-04-07 17:02:49,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc174405/b8954a412f4d40dd84dbe33f76b956bc/FLAGb6d746385 [2022-04-07 17:02:49,717 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:02:49,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c [2022-04-07 17:02:49,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc174405/b8954a412f4d40dd84dbe33f76b956bc/FLAGb6d746385 [2022-04-07 17:02:50,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc174405/b8954a412f4d40dd84dbe33f76b956bc [2022-04-07 17:02:50,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:02:50,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:02:50,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:02:50,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:02:50,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:02:50,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b30bfa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50, skipping insertion in model container [2022-04-07 17:02:50,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:02:50,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:02:50,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[854,867] [2022-04-07 17:02:50,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[1096,1109] [2022-04-07 17:02:50,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[1375,1388] [2022-04-07 17:02:50,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:02:50,324 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:02:50,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[854,867] [2022-04-07 17:02:50,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[1096,1109] [2022-04-07 17:02:50,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i.v+lhb-reducer.c[1375,1388] [2022-04-07 17:02:50,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:02:50,349 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:02:50,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50 WrapperNode [2022-04-07 17:02:50,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:02:50,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:02:50,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:02:50,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:02:50,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:02:50,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:02:50,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:02:50,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:02:50,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:02:50,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:02:50,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 17:02:50,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 17:02:50,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:02:50,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:02:50,430 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:02:50,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:02:50,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:02:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:02:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:02:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:02:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:02:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:02:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:02:50,480 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:02:50,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:02:50,634 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:02:50,639 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:02:50,639 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-07 17:02:50,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:02:50 BoogieIcfgContainer [2022-04-07 17:02:50,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:02:50,641 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:02:50,641 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:02:50,649 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:02:50,665 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:02:50" (1/1) ... [2022-04-07 17:02:50,667 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:02:50,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:02:50 BasicIcfg [2022-04-07 17:02:50,699 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:02:50,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:02:50,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:02:50,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:02:50,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:02:50" (1/4) ... [2022-04-07 17:02:50,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb8af0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:02:50, skipping insertion in model container [2022-04-07 17:02:50,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:02:50" (2/4) ... [2022-04-07 17:02:50,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb8af0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:02:50, skipping insertion in model container [2022-04-07 17:02:50,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:02:50" (3/4) ... [2022-04-07 17:02:50,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb8af0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:02:50, skipping insertion in model container [2022-04-07 17:02:50,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:02:50" (4/4) ... [2022-04-07 17:02:50,704 INFO L111 eAbstractionObserver]: Analyzing ICFG id_build.i.v+lhb-reducer.cJordan [2022-04-07 17:02:50,708 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:02:50,708 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-04-07 17:02:50,765 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:02:50,770 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:02:50,770 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-04-07 17:02:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:02:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-07 17:02:50,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:02:50,790 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:02:50,790 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:02:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:02:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash 132956993, now seen corresponding path program 1 times [2022-04-07 17:02:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:02:50,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102281764] [2022-04-07 17:02:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:02:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:02:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:02:51,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:02:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:02:51,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [64] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= v_~__return_100~0_2 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_100~0=v_~__return_100~0_2, #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[~__return_main~0, ~__return_100~0, #NULL.offset, #NULL.base] {27#true} is VALID [2022-04-07 17:02:51,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [67] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 17:02:51,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 17:02:51,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [62] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:02:51,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [64] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= v_~__return_100~0_2 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_100~0=v_~__return_100~0_2, #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[~__return_main~0, ~__return_100~0, #NULL.offset, #NULL.base] {27#true} is VALID [2022-04-07 17:02:51,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [67] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 17:02:51,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 17:02:51,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [63] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 17:02:51,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [66] mainENTRY-->L95: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__nlen~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= 0 v_main_~main__i~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__nlen~0=v_main_~main__nlen~0_2, main_~main__length~0=v_main_~main__length~0_1, main_~main__offset~0=v_main_~main__offset~0_1, main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__nlen~0, main_#t~nondet4, main_~main__length~0, main_~main__offset~0, main_~main__j~0, main_~main__i~0] {27#true} is VALID [2022-04-07 17:02:51,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [68] L95-->L26: Formula: (and (< v_main_~main__i~0_6 v_main_~main__nlen~0_5) (= 0 v_main_~main__j~0_4)) InVars {main_~main__nlen~0=v_main_~main__nlen~0_5, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__nlen~0=v_main_~main__nlen~0_5, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {32#(< main_~main__i~0 main_~main__nlen~0)} is VALID [2022-04-07 17:02:51,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(< main_~main__i~0 main_~main__nlen~0)} [70] L26-->L33: Formula: (and (= (ite (<= (+ v_main_~main__i~0_9 1) v_main_~main__nlen~0_8) 1 0) v_main_~__tmp_1~0_1) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (< v_main_~main__j~0_6 8)) InVars {main_~main__nlen~0=v_main_~main__nlen~0_8, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__nlen~0=v_main_~main__nlen~0_8, main_~main__j~0=v_main_~main__j~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {33#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-07 17:02:51,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#(not (= main_~__VERIFIER_assert__cond~0 0))} [73] L33-->L35: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-07 17:02:51,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [75] L35-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-07 17:02:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:02:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:02:51,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102281764] [2022-04-07 17:02:51,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102281764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:02:51,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:02:51,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:02:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588470750] [2022-04-07 17:02:51,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:02:51,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 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 10 [2022-04-07 17:02:51,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:02:51,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:02:51,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:02:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:02:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:02:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:02:51,134 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 19 states have internal predecessors, (26), 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 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,301 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-07 17:02:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:02:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 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 10 [2022-04-07 17:02:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:02:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-07 17:02:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-07 17:02:51,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-07 17:02:51,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:02:51,347 INFO L225 Difference]: With dead ends: 24 [2022-04-07 17:02:51,348 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 17:02:51,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-07 17:02:51,353 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:02:51,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:02:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 17:02:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-07 17:02:51,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:02:51,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,373 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,373 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,375 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 17:02:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 17:02:51,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:02:51,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:02:51,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 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 18 states. [2022-04-07 17:02:51,376 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 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 18 states. [2022-04-07 17:02:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,377 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 17:02:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 17:02:51,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:02:51,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:02:51,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:02:51,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:02:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-07 17:02:51,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2022-04-07 17:02:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:02:51,380 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-07 17:02:51,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 17:02:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 17:02:51,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:02:51,381 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:02:51,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:02:51,382 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:02:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:02:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1077314396, now seen corresponding path program 1 times [2022-04-07 17:02:51,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:02:51,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979414242] [2022-04-07 17:02:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:02:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:02:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:02:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:02:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:02:51,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [64] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= v_~__return_100~0_2 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_100~0=v_~__return_100~0_2, #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[~__return_main~0, ~__return_100~0, #NULL.offset, #NULL.base] {121#true} is VALID [2022-04-07 17:02:51,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#true} [67] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-07 17:02:51,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-07 17:02:51,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {121#true} [62] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:02:51,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [64] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= v_~__return_100~0_2 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_100~0=v_~__return_100~0_2, #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[~__return_main~0, ~__return_100~0, #NULL.offset, #NULL.base] {121#true} is VALID [2022-04-07 17:02:51,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#true} [67] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-07 17:02:51,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121#true} {121#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-07 17:02:51,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {121#true} [63] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-07 17:02:51,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {121#true} [66] mainENTRY-->L95: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__nlen~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= 0 v_main_~main__i~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__nlen~0=v_main_~main__nlen~0_2, main_~main__length~0=v_main_~main__length~0_1, main_~main__offset~0=v_main_~main__offset~0_1, main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__nlen~0, main_#t~nondet4, main_~main__length~0, main_~main__offset~0, main_~main__j~0, main_~main__i~0] {126#(< 0 (+ main_~main__i~0 1))} is VALID [2022-04-07 17:02:51,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {126#(< 0 (+ main_~main__i~0 1))} [68] L95-->L26: Formula: (and (< v_main_~main__i~0_6 v_main_~main__nlen~0_5) (= 0 v_main_~main__j~0_4)) InVars {main_~main__nlen~0=v_main_~main__nlen~0_5, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__nlen~0=v_main_~main__nlen~0_5, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {126#(< 0 (+ main_~main__i~0 1))} is VALID [2022-04-07 17:02:51,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#(< 0 (+ main_~main__i~0 1))} [70] L26-->L33: Formula: (and (= (ite (<= (+ v_main_~main__i~0_9 1) v_main_~main__nlen~0_8) 1 0) v_main_~__tmp_1~0_1) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (< v_main_~main__j~0_6 8)) InVars {main_~main__nlen~0=v_main_~main__nlen~0_8, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__nlen~0=v_main_~main__nlen~0_8, main_~main__j~0=v_main_~main__j~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {126#(< 0 (+ main_~main__i~0 1))} is VALID [2022-04-07 17:02:51,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(< 0 (+ main_~main__i~0 1))} [74] L33-->L69: Formula: (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {126#(< 0 (+ main_~main__i~0 1))} is VALID [2022-04-07 17:02:51,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#(< 0 (+ main_~main__i~0 1))} [77] L69-->L46: Formula: (and (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= (ite (< 0 (+ v_main_~main__i~0_13 1)) 1 0) v_main_~__tmp_2~0_1)) InVars {main_~main__i~0=v_main_~main__i~0_13} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {127#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-07 17:02:51,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {127#(not (= main_~__VERIFIER_assert__cond~1 0))} [78] L46-->L48: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {122#false} is VALID [2022-04-07 17:02:51,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {122#false} [80] L48-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#false} is VALID [2022-04-07 17:02:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:02:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:02:51,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979414242] [2022-04-07 17:02:51,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979414242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:02:51,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:02:51,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:02:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537931497] [2022-04-07 17:02:51,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:02:51,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 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 12 [2022-04-07 17:02:51,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:02:51,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:02:51,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:02:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:02:51,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:02:51,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:02:51,461 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,536 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 17:02:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:02:51,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 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 12 [2022-04-07 17:02:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:02:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-07 17:02:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-07 17:02:51,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-07 17:02:51,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:02:51,562 INFO L225 Difference]: With dead ends: 17 [2022-04-07 17:02:51,562 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 17:02:51,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:02:51,565 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:02:51,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:02:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 17:02:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-07 17:02:51,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:02:51,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,567 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,567 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,568 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 17:02:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 17:02:51,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:02:51,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:02:51,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 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 17 states. [2022-04-07 17:02:51,569 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 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 17 states. [2022-04-07 17:02:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,570 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 17:02:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 17:02:51,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:02:51,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:02:51,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:02:51,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:02:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-07 17:02:51,571 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-07 17:02:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:02:51,571 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-07 17:02:51,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:02:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-07 17:02:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 17:02:51,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:02:51,572 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:02:51,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:02:51,572 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:02:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:02:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -211981815, now seen corresponding path program 1 times [2022-04-07 17:02:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:02:51,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199833797] [2022-04-07 17:02:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:02:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:02:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:02:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:02:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:02:51,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [64] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= v_~__return_100~0_2 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_100~0=v_~__return_100~0_2, #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[~__return_main~0, ~__return_100~0, #NULL.offset, #NULL.base] {202#true} is VALID [2022-04-07 17:02:51,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} [67] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-07 17:02:51,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {202#true} {202#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-07 17:02:51,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} [62] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:02:51,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_100~0)| ~__return_100~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [64] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= v_~__return_100~0_2 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_100~0=v_~__return_100~0_2, #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[~__return_main~0, ~__return_100~0, #NULL.offset, #NULL.base] {202#true} is VALID [2022-04-07 17:02:51,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} [67] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-07 17:02:51,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-07 17:02:51,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} [63] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-07 17:02:51,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} [66] mainENTRY-->L95: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__nlen~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= 0 v_main_~main__i~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__nlen~0=v_main_~main__nlen~0_2, main_~main__length~0=v_main_~main__length~0_1, main_~main__offset~0=v_main_~main__offset~0_1, main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__nlen~0, main_#t~nondet4, main_~main__length~0, main_~main__offset~0, main_~main__j~0, main_~main__i~0] {202#true} is VALID [2022-04-07 17:02:51,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#true} [68] L95-->L26: Formula: (and (< v_main_~main__i~0_6 v_main_~main__nlen~0_5) (= 0 v_main_~main__j~0_4)) InVars {main_~main__nlen~0=v_main_~main__nlen~0_5, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__nlen~0=v_main_~main__nlen~0_5, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {202#true} is VALID [2022-04-07 17:02:51,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} [70] L26-->L33: Formula: (and (= (ite (<= (+ v_main_~main__i~0_9 1) v_main_~main__nlen~0_8) 1 0) v_main_~__tmp_1~0_1) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (< v_main_~main__j~0_6 8)) InVars {main_~main__nlen~0=v_main_~main__nlen~0_8, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__nlen~0=v_main_~main__nlen~0_8, main_~main__j~0=v_main_~main__j~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {207#(or (and (= main_~__VERIFIER_assert__cond~0 0) (not (<= (+ main_~main__i~0 1) main_~main__nlen~0))) (and (<= (+ main_~main__i~0 1) main_~main__nlen~0) (= main_~__VERIFIER_assert__cond~0 1)))} is VALID [2022-04-07 17:02:51,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#(or (and (= main_~__VERIFIER_assert__cond~0 0) (not (<= (+ main_~main__i~0 1) main_~main__nlen~0))) (and (<= (+ main_~main__i~0 1) main_~main__nlen~0) (= main_~__VERIFIER_assert__cond~0 1)))} [74] L33-->L69: Formula: (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {208#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2022-04-07 17:02:51,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} [77] L69-->L46: Formula: (and (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= (ite (< 0 (+ v_main_~main__i~0_13 1)) 1 0) v_main_~__tmp_2~0_1)) InVars {main_~main__i~0=v_main_~main__i~0_13} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {208#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2022-04-07 17:02:51,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} [79] L46-->L79: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= (+ v_main_~main__j~0_9 1) v_main_~main__j~0_8)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main__j~0=v_main_~main__j~0_9} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main__j~0=v_main_~main__j~0_8} AuxVars[] AssignedVars[main_~main__j~0] {208#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} is VALID [2022-04-07 17:02:51,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#(<= (+ main_~main__i~0 1) main_~main__nlen~0)} [82] L79-->L62: Formula: (and (= v_main_~__tmp_3~0_1 (ite (<= (+ v_main_~main__i~0_1 1) v_main_~main__nlen~0_1) 1 0)) (< v_main_~main__j~0_1 8) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__nlen~0=v_main_~main__nlen~0_1, main_~main__j~0=v_main_~main__j~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__nlen~0=v_main_~main__nlen~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__j~0=v_main_~main__j~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {209#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-07 17:02:51,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#(not (= main_~__VERIFIER_assert__cond~2 0))} [84] L62-->L64: Formula: (= v_main_~__VERIFIER_assert__cond~2_3 0) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} OutVars{main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-07 17:02:51,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {203#false} [88] L64-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-07 17:02:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:02:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:02:51,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199833797] [2022-04-07 17:02:51,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199833797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:02:51,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:02:51,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:02:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267870438] [2022-04-07 17:02:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:02:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07 17:02:51,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:02:51,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07 17:02:51,680 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-07 17:02:51,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:02:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:02:51,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:02:51,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:02:51,684 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07 17:02:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,877 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-07 17:02:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:02:51,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07 17:02:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:02:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07 17:02:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-07 17:02:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07 17:02:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-07 17:02:51,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-07 17:02:51,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:02:51,904 INFO L225 Difference]: With dead ends: 23 [2022-04-07 17:02:51,904 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:02:51,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 17:02:51,905 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:02:51,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:02:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:02:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:02:51,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:02:51,906 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-07 17:02:51,906 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-07 17:02:51,906 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-07 17:02:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,907 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:02:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:02:51,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:02:51,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:02:51,907 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-07 17:02:51,907 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-07 17:02:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:02:51,907 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:02:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:02:51,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:02:51,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:02:51,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:02:51,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:02:51,908 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-07 17:02:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:02:51,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-07 17:02:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:02:51,908 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:02:51,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-07 17:02:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:02:51,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:02:51,910 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-04-07 17:02:51,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-04-07 17:02:51,911 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-04-07 17:02:51,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 17:02:51,913 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 17:02:51,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:02:51,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:02:51 BasicIcfg [2022-04-07 17:02:51,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:02:51,925 INFO L158 Benchmark]: Toolchain (without parser) took 1759.30ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 142.7MB in the beginning and 196.0MB in the end (delta: -53.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:02:51,925 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory was 159.1MB in the beginning and 159.0MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:02:51,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.02ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 142.4MB in the beginning and 207.8MB in the end (delta: -65.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-07 17:02:51,926 INFO L158 Benchmark]: Boogie Preprocessor took 18.75ms. Allocated memory is still 232.8MB. Free memory was 207.8MB in the beginning and 206.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:02:51,926 INFO L158 Benchmark]: RCFGBuilder took 271.60ms. Allocated memory is still 232.8MB. Free memory was 206.7MB in the beginning and 194.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 17:02:51,926 INFO L158 Benchmark]: IcfgTransformer took 57.58ms. Allocated memory is still 232.8MB. Free memory was 194.7MB in the beginning and 192.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:02:51,927 INFO L158 Benchmark]: TraceAbstraction took 1224.14ms. Allocated memory is still 232.8MB. Free memory was 192.1MB in the beginning and 196.0MB in the end (delta: -3.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:02:51,929 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.10ms. Allocated memory is still 194.0MB. Free memory was 159.1MB in the beginning and 159.0MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.02ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 142.4MB in the beginning and 207.8MB in the end (delta: -65.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.75ms. Allocated memory is still 232.8MB. Free memory was 207.8MB in the beginning and 206.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.60ms. Allocated memory is still 232.8MB. Free memory was 206.7MB in the beginning and 194.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 57.58ms. Allocated memory is still 232.8MB. Free memory was 194.7MB in the beginning and 192.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1224.14ms. Allocated memory is still 232.8MB. Free memory was 192.1MB in the beginning and 196.0MB in the end (delta: -3.9MB). 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: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 64]: 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, 24 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 41 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 17:02:51,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...