/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/nla-digbench-scaling/geo1-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 18:44:30,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 18:44:30,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 18:44:30,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 18:44:30,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 18:44:30,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 18:44:30,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 18:44:30,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 18:44:30,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 18:44:30,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 18:44:30,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 18:44:30,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 18:44:30,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 18:44:30,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 18:44:30,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 18:44:30,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 18:44:30,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 18:44:30,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 18:44:30,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 18:44:30,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 18:44:30,995 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 18:44:30,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 18:44:30,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 18:44:30,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 18:44:30,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 18:44:31,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 18:44:31,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 18:44:31,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 18:44:31,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 18:44:31,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 18:44:31,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 18:44:31,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 18:44:31,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 18:44:31,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 18:44:31,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 18:44:31,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 18:44:31,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 18:44:31,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 18:44:31,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 18:44:31,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 18:44:31,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 18:44:31,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 18:44:31,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 18:44:31,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 18:44:31,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 18:44:31,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 18:44:31,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 18:44:31,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 18:44:31,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 18:44:31,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 18:44:31,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 18:44:31,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 18:44:31,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 18:44:31,032 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 18:44:31,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 18:44:31,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 18:44:31,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 18:44:31,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 18:44:31,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 18:44:31,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 18:44:31,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 18:44:31,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:44:31,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 18:44:31,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 18:44:31,034 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 18:44:31,034 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 18:44:31,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 18:44:31,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 18:44:31,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 18:44:31,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 18:44:31,301 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 18:44:31,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound50.c [2022-04-27 18:44:31,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a394ed630/27d75235b2c447c28b38c29a710a3420/FLAG0bab596ea [2022-04-27 18:44:31,712 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 18:44:31,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound50.c [2022-04-27 18:44:31,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a394ed630/27d75235b2c447c28b38c29a710a3420/FLAG0bab596ea [2022-04-27 18:44:32,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a394ed630/27d75235b2c447c28b38c29a710a3420 [2022-04-27 18:44:32,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 18:44:32,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 18:44:32,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 18:44:32,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 18:44:32,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 18:44:32,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0cdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32, skipping insertion in model container [2022-04-27 18:44:32,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 18:44:32,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 18:44:32,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound50.c[546,559] [2022-04-27 18:44:32,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:44:32,336 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 18:44:32,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound50.c[546,559] [2022-04-27 18:44:32,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 18:44:32,358 INFO L208 MainTranslator]: Completed translation [2022-04-27 18:44:32,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32 WrapperNode [2022-04-27 18:44:32,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 18:44:32,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 18:44:32,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 18:44:32,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 18:44:32,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 18:44:32,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 18:44:32,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 18:44:32,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 18:44:32,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 18:44:32,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:32,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 18:44:32,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 18:44:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 18:44:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 18:44:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 18:44:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 18:44:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 18:44:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 18:44:32,439 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 18:44:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 18:44:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 18:44:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 18:44:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 18:44:32,489 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 18:44:32,491 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 18:44:32,627 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 18:44:32,633 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 18:44:32,633 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 18:44:32,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:32 BoogieIcfgContainer [2022-04-27 18:44:32,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 18:44:32,635 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 18:44:32,636 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 18:44:32,636 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 18:44:32,639 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:32" (1/1) ... [2022-04-27 18:44:32,641 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 18:44:32,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:44:32 BasicIcfg [2022-04-27 18:44:32,693 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 18:44:32,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 18:44:32,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 18:44:32,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 18:44:32,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 06:44:32" (1/4) ... [2022-04-27 18:44:32,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dbd389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:44:32, skipping insertion in model container [2022-04-27 18:44:32,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 06:44:32" (2/4) ... [2022-04-27 18:44:32,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dbd389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 06:44:32, skipping insertion in model container [2022-04-27 18:44:32,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 06:44:32" (3/4) ... [2022-04-27 18:44:32,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dbd389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:44:32, skipping insertion in model container [2022-04-27 18:44:32,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 06:44:32" (4/4) ... [2022-04-27 18:44:32,700 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound50.cJordan [2022-04-27 18:44:32,712 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 18:44:32,712 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 18:44:32,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 18:44:32,765 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38066d25, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@559ee652 [2022-04-27 18:44:32,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 18:44:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 18:44:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 18:44:32,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:32,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:44:32,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1175629711, now seen corresponding path program 1 times [2022-04-27 18:44:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:32,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343665274] [2022-04-27 18:44:32,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:32,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 18:44:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:33,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {33#true} is VALID [2022-04-27 18:44:33,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 18:44:33,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 18:44:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 18:44:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:33,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-27 18:44:33,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-27 18:44:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 18:44:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:33,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-27 18:44:33,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-27 18:44:33,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 18:44:33,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {33#true} is VALID [2022-04-27 18:44:33,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 18:44:33,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 18:44:33,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 18:44:33,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {33#true} is VALID [2022-04-27 18:44:33,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-27 18:44:33,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-27 18:44:33,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-27 18:44:33,097 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-27 18:44:33,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-27 18:44:33,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,098 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-27 18:44:33,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {34#false} is VALID [2022-04-27 18:44:33,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [77] L35-3-->L35-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} [80] L35-4-->L49: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {34#false} is VALID [2022-04-27 18:44:33,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {34#false} [83] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {34#false} is VALID [2022-04-27 18:44:33,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#false} is VALID [2022-04-27 18:44:33,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 18:44:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 18:44:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:44:33,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343665274] [2022-04-27 18:44:33,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343665274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 18:44:33,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 18:44:33,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 18:44:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263310481] [2022-04-27 18:44:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:44:33,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 18:44:33,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:44:33,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:33,142 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-27 18:44:33,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 18:44:33,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:44:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 18:44:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 18:44:33,169 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,306 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 18:44:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 18:44:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 18:44:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:44:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 18:44:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 18:44:33,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-27 18:44:33,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:33,367 INFO L225 Difference]: With dead ends: 31 [2022-04-27 18:44:33,367 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 18:44:33,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 18:44:33,372 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 18:44:33,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 18:44:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 18:44:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 18:44:33,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:44:33,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 18:44:33,397 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 18:44:33,397 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 18:44:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,402 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 18:44:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 18:44:33,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:33,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:33,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 18:44:33,403 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 18:44:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,417 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 18:44:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 18:44:33,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:33,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:33,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:44:33,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:44:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 18:44:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 18:44:33,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2022-04-27 18:44:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:44:33,423 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 18:44:33,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:33,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 18:44:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 18:44:33,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:33,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:44:33,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 18:44:33,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:33,425 INFO L85 PathProgramCache]: Analyzing trace with hash 165914577, now seen corresponding path program 1 times [2022-04-27 18:44:33,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:33,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383681716] [2022-04-27 18:44:33,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:33,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:33,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:44:33,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870772454] [2022-04-27 18:44:33,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:33,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:33,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:44:33,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 18:44:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:33,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 18:44:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:33,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:44:33,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 18:44:33,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {157#true} is VALID [2022-04-27 18:44:33,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 18:44:33,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 18:44:33,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 18:44:33,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {157#true} is VALID [2022-04-27 18:44:33,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {157#true} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {157#true} is VALID [2022-04-27 18:44:33,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {157#true} is VALID [2022-04-27 18:44:33,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 18:44:33,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 18:44:33,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {157#true} {157#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {157#true} is VALID [2022-04-27 18:44:33,707 INFO L272 TraceCheckUtils]: 11: Hoare triple {157#true} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {157#true} is VALID [2022-04-27 18:44:33,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {157#true} is VALID [2022-04-27 18:44:33,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {157#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 18:44:33,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {157#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-27 18:44:33,713 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {157#true} {157#true} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {157#true} is VALID [2022-04-27 18:44:33,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {157#true} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {210#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 18:44:33,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {210#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [78] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {210#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 18:44:33,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {210#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [82] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {210#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 18:44:33,716 INFO L272 TraceCheckUtils]: 19: Hoare triple {210#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [84] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:44:33,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:33,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-27 18:44:33,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {158#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-27 18:44:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 18:44:33,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 18:44:33,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:44:33,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383681716] [2022-04-27 18:44:33,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:44:33,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870772454] [2022-04-27 18:44:33,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870772454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 18:44:33,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 18:44:33,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 18:44:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794074453] [2022-04-27 18:44:33,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:44:33,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 18:44:33,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:44:33,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:44:33,749 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-27 18:44:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 18:44:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:44:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 18:44:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 18:44:33,751 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:44:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,874 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 18:44:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 18:44:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 18:44:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:44:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:44:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 18:44:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:44:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 18:44:33,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 18:44:33,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:33,914 INFO L225 Difference]: With dead ends: 34 [2022-04-27 18:44:33,914 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 18:44:33,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 18:44:33,916 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 18:44:33,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 18:44:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 18:44:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 18:44:33,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:44:33,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 18:44:33,921 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 18:44:33,921 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 18:44:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,924 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 18:44:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-27 18:44:33,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:33,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:33,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 18:44:33,925 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 18:44:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:33,928 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 18:44:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-27 18:44:33,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:33,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:33,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:44:33,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:44:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 18:44:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 18:44:33,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-27 18:44:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:44:33,932 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 18:44:33,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 18:44:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 18:44:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 18:44:33,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:33,933 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:44:33,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 18:44:34,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:34,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash 815968169, now seen corresponding path program 1 times [2022-04-27 18:44:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:34,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711385325] [2022-04-27 18:44:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:34,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:44:34,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010386141] [2022-04-27 18:44:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:34,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:34,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:34,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:44:34,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 18:44:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:34,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 18:44:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:34,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:44:34,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {366#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {366#true} is VALID [2022-04-27 18:44:34,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {366#true} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {374#(<= ~counter~0 0)} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {374#(<= ~counter~0 0)} {366#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {374#(<= ~counter~0 0)} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {374#(<= ~counter~0 0)} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {374#(<= ~counter~0 0)} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {374#(<= ~counter~0 0)} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#(<= ~counter~0 0)} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#(<= ~counter~0 0)} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {374#(<= ~counter~0 0)} {374#(<= ~counter~0 0)} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,424 INFO L272 TraceCheckUtils]: 11: Hoare triple {374#(<= ~counter~0 0)} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {374#(<= ~counter~0 0)} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#(<= ~counter~0 0)} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {374#(<= ~counter~0 0)} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,427 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {374#(<= ~counter~0 0)} {374#(<= ~counter~0 0)} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {374#(<= ~counter~0 0)} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {374#(<= ~counter~0 0)} is VALID [2022-04-27 18:44:34,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {374#(<= ~counter~0 0)} [78] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {423#(<= |main_#t~post6| 0)} is VALID [2022-04-27 18:44:34,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#(<= |main_#t~post6| 0)} [81] L35-1-->L35-4: Formula: (not (< |v_main_#t~post6_3| 50)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {367#false} is VALID [2022-04-27 18:44:34,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {367#false} [80] L35-4-->L49: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {367#false} is VALID [2022-04-27 18:44:34,429 INFO L272 TraceCheckUtils]: 20: Hoare triple {367#false} [83] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {367#false} is VALID [2022-04-27 18:44:34,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {367#false} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {367#false} is VALID [2022-04-27 18:44:34,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {367#false} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {367#false} is VALID [2022-04-27 18:44:34,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {367#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {367#false} is VALID [2022-04-27 18:44:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 18:44:34,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 18:44:34,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:44:34,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711385325] [2022-04-27 18:44:34,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:44:34,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010386141] [2022-04-27 18:44:34,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010386141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 18:44:34,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 18:44:34,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 18:44:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647112292] [2022-04-27 18:44:34,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 18:44:34,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 18:44:34,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:44:34,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:34,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:34,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 18:44:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:44:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 18:44:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 18:44:34,450 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:34,499 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 18:44:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 18:44:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 18:44:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:44:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 18:44:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 18:44:34,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-27 18:44:34,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:34,534 INFO L225 Difference]: With dead ends: 32 [2022-04-27 18:44:34,534 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 18:44:34,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 18:44:34,538 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 18:44:34,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 18:44:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 18:44:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 18:44:34,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:44:34,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 18:44:34,546 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 18:44:34,548 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 18:44:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:34,553 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 18:44:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 18:44:34,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:34,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:34,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 18:44:34,560 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 18:44:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:34,564 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 18:44:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 18:44:34,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:34,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:34,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:44:34,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:44:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 18:44:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 18:44:34,574 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2022-04-27 18:44:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:44:34,574 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 18:44:34,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 18:44:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 18:44:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 18:44:34,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:44:34,575 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:44:34,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 18:44:34,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 18:44:34,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:44:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:44:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash -974402257, now seen corresponding path program 1 times [2022-04-27 18:44:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:44:34,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028606463] [2022-04-27 18:44:34,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:34,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:44:34,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:44:34,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482996907] [2022-04-27 18:44:34,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:44:34,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:44:34,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:44:34,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 18:44:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:34,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 18:44:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:44:34,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:44:39,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {569#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:39,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {569#true} is VALID [2022-04-27 18:44:39,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:39,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:39,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {569#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:39,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {569#true} is VALID [2022-04-27 18:44:39,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {569#true} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {569#true} is VALID [2022-04-27 18:44:39,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {569#true} is VALID [2022-04-27 18:44:39,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:39,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:39,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {569#true} {569#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {569#true} is VALID [2022-04-27 18:44:39,201 INFO L272 TraceCheckUtils]: 11: Hoare triple {569#true} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {569#true} is VALID [2022-04-27 18:44:39,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {569#true} is VALID [2022-04-27 18:44:39,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:39,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {569#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:39,202 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {569#true} {569#true} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {569#true} is VALID [2022-04-27 18:44:39,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#true} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {569#true} is VALID [2022-04-27 18:44:39,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#true} [78] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {569#true} is VALID [2022-04-27 18:44:39,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#true} [82] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {569#true} is VALID [2022-04-27 18:44:39,205 INFO L272 TraceCheckUtils]: 19: Hoare triple {569#true} [84] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {569#true} is VALID [2022-04-27 18:44:39,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {569#true} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {634#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:39,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {634#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [91] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:44:39,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} [94] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:44:39,208 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} {569#true} [99] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {645#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:39,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {645#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [87] L36-1-->L35-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {645#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:39,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {645#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [80] L35-4-->L49: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {652#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID [2022-04-27 18:44:39,211 INFO L272 TraceCheckUtils]: 26: Hoare triple {652#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} [83] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:44:39,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:39,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {570#false} is VALID [2022-04-27 18:44:39,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {570#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#false} is VALID [2022-04-27 18:44:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 18:44:39,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 18:44:45,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {570#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#false} is VALID [2022-04-27 18:44:45,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {570#false} is VALID [2022-04-27 18:44:45,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 18:44:45,545 INFO L272 TraceCheckUtils]: 26: Hoare triple {676#(= (+ main_~x~0 1) main_~y~0)} [83] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 18:44:45,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {645#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [80] L35-4-->L49: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {676#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-27 18:44:45,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {645#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [87] L36-1-->L35-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {645#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:45,547 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} {569#true} [99] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {645#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 18:44:45,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} [94] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:44:45,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {695#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [91] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 18:44:45,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {569#true} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {695#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 18:44:45,549 INFO L272 TraceCheckUtils]: 19: Hoare triple {569#true} [84] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {569#true} is VALID [2022-04-27 18:44:45,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#true} [82] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 50) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {569#true} is VALID [2022-04-27 18:44:45,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#true} [78] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {569#true} is VALID [2022-04-27 18:44:45,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {569#true} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {569#true} is VALID [2022-04-27 18:44:45,550 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {569#true} {569#true} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {569#true} is VALID [2022-04-27 18:44:45,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {569#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:45,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:45,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {569#true} is VALID [2022-04-27 18:44:45,550 INFO L272 TraceCheckUtils]: 11: Hoare triple {569#true} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {569#true} is VALID [2022-04-27 18:44:45,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {569#true} {569#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {569#true} is VALID [2022-04-27 18:44:45,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:45,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:45,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {569#true} is VALID [2022-04-27 18:44:45,551 INFO L272 TraceCheckUtils]: 6: Hoare triple {569#true} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {569#true} is VALID [2022-04-27 18:44:45,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {569#true} is VALID [2022-04-27 18:44:45,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {569#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:45,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:45,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:45,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {569#true} is VALID [2022-04-27 18:44:45,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {569#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#true} is VALID [2022-04-27 18:44:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 18:44:45,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:44:45,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028606463] [2022-04-27 18:44:45,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:44:45,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482996907] [2022-04-27 18:44:45,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482996907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 18:44:45,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 18:44:45,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 18:44:45,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107185480] [2022-04-27 18:44:45,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 18:44:45,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-04-27 18:44:45,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:44:45,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 18:44:45,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:45,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 18:44:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:44:45,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 18:44:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 18:44:45,584 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 18:44:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:45,784 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 18:44:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 18:44:45,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-04-27 18:44:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:44:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 18:44:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 18:44:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 18:44:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 18:44:45,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-27 18:44:45,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:44:45,830 INFO L225 Difference]: With dead ends: 30 [2022-04-27 18:44:45,830 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 18:44:45,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-27 18:44:45,832 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 18:44:45,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-04-27 18:44:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 18:44:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 18:44:45,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:44:45,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 18:44:45,833 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 18:44:45,833 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 18:44:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:45,833 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 18:44:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:44:45,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:45,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:45,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 18:44:45,834 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 18:44:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:44:45,834 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 18:44:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:44:45,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:45,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:44:45,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:44:45,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:44:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 18:44:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 18:44:45,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-27 18:44:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:44:45,835 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 18:44:45,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 18:44:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 18:44:45,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:44:45,837 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 18:44:45,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 18:44:46,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:44:46,054 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 18:44:46,055 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 18:44:46,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 06:44:46 BasicIcfg [2022-04-27 18:44:46,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 18:44:46,059 INFO L158 Benchmark]: Toolchain (without parser) took 13907.35ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 140.8MB in the beginning and 178.3MB in the end (delta: -37.5MB). Peak memory consumption was 822.8kB. Max. memory is 8.0GB. [2022-04-27 18:44:46,059 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 18:44:46,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.40ms. Allocated memory is still 186.6MB. Free memory was 140.6MB in the beginning and 165.3MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 18:44:46,061 INFO L158 Benchmark]: Boogie Preprocessor took 22.60ms. Allocated memory is still 186.6MB. Free memory was 165.3MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 18:44:46,062 INFO L158 Benchmark]: RCFGBuilder took 252.31ms. Allocated memory is still 186.6MB. Free memory was 163.7MB in the beginning and 152.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 18:44:46,062 INFO L158 Benchmark]: IcfgTransformer took 57.20ms. Allocated memory is still 186.6MB. Free memory was 152.6MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 18:44:46,062 INFO L158 Benchmark]: TraceAbstraction took 13363.83ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 150.6MB in the beginning and 178.3MB in the end (delta: -27.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-27 18:44:46,064 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.13ms. Allocated memory is still 186.6MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.40ms. Allocated memory is still 186.6MB. Free memory was 140.6MB in the beginning and 165.3MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.60ms. Allocated memory is still 186.6MB. Free memory was 165.3MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 252.31ms. Allocated memory is still 186.6MB. Free memory was 163.7MB in the beginning and 152.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 57.20ms. Allocated memory is still 186.6MB. Free memory was 152.6MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 13363.83ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 150.6MB in the beginning and 178.3MB in the end (delta: -27.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: 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 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 101 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 125 ConstructedInterpolants, 1 QuantifiedInterpolants, 272 SizeOfPredicates, 5 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 22/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 18:44:46,080 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...