/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/mannadiv_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 20:32:55,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 20:32:55,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 20:32:55,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 20:32:55,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 20:32:56,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 20:32:56,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 20:32:56,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 20:32:56,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 20:32:56,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 20:32:56,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 20:32:56,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 20:32:56,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 20:32:56,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 20:32:56,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 20:32:56,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 20:32:56,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 20:32:56,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 20:32:56,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 20:32:56,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 20:32:56,011 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 20:32:56,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 20:32:56,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 20:32:56,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 20:32:56,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 20:32:56,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 20:32:56,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 20:32:56,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 20:32:56,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 20:32:56,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 20:32:56,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 20:32:56,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 20:32:56,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 20:32:56,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 20:32:56,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 20:32:56,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 20:32:56,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 20:32:56,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 20:32:56,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 20:32:56,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 20:32:56,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 20:32:56,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 20:32:56,022 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 20:32:56,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 20:32:56,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 20:32:56,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 20:32:56,029 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 20:32:56,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 20:32:56,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 20:32:56,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 20:32:56,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 20:32:56,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 20:32:56,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 20:32:56,030 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 20:32:56,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 20:32:56,030 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 20:32:56,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 20:32:56,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 20:32:56,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 20:32:56,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 20:32:56,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 20:32:56,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:32:56,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 20:32:56,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 20:32:56,031 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 20:32:56,031 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 20:32:56,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 20:32:56,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 20:32:56,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 20:32:56,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 20:32:56,236 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 20:32:56,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound1.c [2022-04-07 20:32:56,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53170b7f9/bcccd555a6554db786974b766d3a6346/FLAGe1fb86f61 [2022-04-07 20:32:56,582 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 20:32:56,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound1.c [2022-04-07 20:32:56,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53170b7f9/bcccd555a6554db786974b766d3a6346/FLAGe1fb86f61 [2022-04-07 20:32:57,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53170b7f9/bcccd555a6554db786974b766d3a6346 [2022-04-07 20:32:57,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 20:32:57,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 20:32:57,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 20:32:57,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 20:32:57,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 20:32:57,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b24a935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57, skipping insertion in model container [2022-04-07 20:32:57,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 20:32:57,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 20:32:57,160 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/mannadiv_unwindbound1.c[573,586] [2022-04-07 20:32:57,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:32:57,189 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 20:32:57,200 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/mannadiv_unwindbound1.c[573,586] [2022-04-07 20:32:57,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:32:57,222 INFO L208 MainTranslator]: Completed translation [2022-04-07 20:32:57,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57 WrapperNode [2022-04-07 20:32:57,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 20:32:57,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 20:32:57,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 20:32:57,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 20:32:57,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 20:32:57,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 20:32:57,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 20:32:57,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 20:32:57,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:32:57,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:32:57,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 20:32:57,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 20:32:57,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 20:32:57,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 20:32:57,311 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 20:32:57,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 20:32:57,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 20:32:57,312 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 20:32:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 20:32:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 20:32:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 20:32:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 20:32:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 20:32:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 20:32:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 20:32:57,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 20:32:57,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 20:32:57,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 20:32:57,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 20:32:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 20:32:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 20:32:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 20:32:57,362 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 20:32:57,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 20:32:57,515 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 20:32:57,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 20:32:57,519 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 20:32:57,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:32:57 BoogieIcfgContainer [2022-04-07 20:32:57,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 20:32:57,521 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 20:32:57,521 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 20:32:57,532 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 20:32:57,534 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:32:57" (1/1) ... [2022-04-07 20:32:57,535 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 20:32:57,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:32:57 BasicIcfg [2022-04-07 20:32:57,561 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 20:32:57,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 20:32:57,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 20:32:57,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 20:32:57,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 08:32:57" (1/4) ... [2022-04-07 20:32:57,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d400c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:32:57, skipping insertion in model container [2022-04-07 20:32:57,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:32:57" (2/4) ... [2022-04-07 20:32:57,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d400c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:32:57, skipping insertion in model container [2022-04-07 20:32:57,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:32:57" (3/4) ... [2022-04-07 20:32:57,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d400c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:32:57, skipping insertion in model container [2022-04-07 20:32:57,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:32:57" (4/4) ... [2022-04-07 20:32:57,571 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound1.cJordan [2022-04-07 20:32:57,574 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 20:32:57,574 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 20:32:57,614 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 20:32:57,620 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 20:32:57,620 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 20:32:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-07 20:32:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 20:32:57,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:32:57,648 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:32:57,648 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:32:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:32:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-04-07 20:32:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:32:57,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365456010] [2022-04-07 20:32:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:32:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:32:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 20:32:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:57,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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-07 20:32:57,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:32:57,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:32:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 20:32:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:57,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [78] 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-07 20:32:57,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-07 20:32:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 20:32:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:57,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [78] 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-07 20:32:57,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-07 20:32:57,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [70] 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-07 20:32:57,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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-07 20:32:57,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:32:57,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:32:57,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:32:57,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {33#true} is VALID [2022-04-07 20:32:57,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-07 20:32:57,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [78] 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-07 20:32:57,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-07 20:32:57,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-07 20:32:57,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} [78] 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-07 20:32:57,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,832 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-07 20:32:57,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {34#false} is VALID [2022-04-07 20:32:57,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [82] L41-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,833 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {34#false} is VALID [2022-04-07 20:32:57,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#false} is VALID [2022-04-07 20:32:57,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [92] L16-->L17: Formula: (= 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[] {34#false} is VALID [2022-04-07 20:32:57,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:32:57,834 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-07 20:32:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:32:57,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365456010] [2022-04-07 20:32:57,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365456010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:32:57,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:32:57,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 20:32:57,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258973416] [2022-04-07 20:32:57,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:32:57,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 22 [2022-04-07 20:32:57,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:32:57,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-07 20:32:57,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:32:57,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 20:32:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:32:57,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 20:32:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:32:57,875 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-07 20:32:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:57,949 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-07 20:32:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 20:32:57,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 22 [2022-04-07 20:32:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:32:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-07 20:32:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-07 20:32:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-07 20:32:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-07 20:32:57,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-07 20:32:57,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:32:57,999 INFO L225 Difference]: With dead ends: 31 [2022-04-07 20:32:57,999 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 20:32:58,000 INFO L912 BasicCegarLoop]: 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-07 20:32:58,002 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:32:58,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:32:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 20:32:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-07 20:32:58,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:32:58,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-07 20:32:58,031 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-07 20:32:58,032 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-07 20:32:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:58,040 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 20:32:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-07 20:32:58,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:32:58,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:32:58,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-07 20:32:58,047 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-07 20:32:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:58,051 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 20:32:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-07 20:32:58,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:32:58,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:32:58,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:32:58,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:32:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-07 20:32:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-07 20:32:58,063 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-07 20:32:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:32:58,063 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-07 20:32:58,063 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-07 20:32:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-07 20:32:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 20:32:58,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:32:58,064 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:32:58,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 20:32:58,069 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:32:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:32:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-04-07 20:32:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:32:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457825382] [2022-04-07 20:32:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:32:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:32:58,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:32:58,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843307214] [2022-04-07 20:32:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:32:58,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:32:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:32:58,103 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-07 20:32:58,104 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-07 20:32:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:58,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 20:32:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:58,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:32:58,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 20:32:58,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [72] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#(<= ~counter~0 0)} {157#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,349 INFO L272 TraceCheckUtils]: 6: Hoare triple {165#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {165#(<= ~counter~0 0)} [78] 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] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#(<= ~counter~0 0)} [81] 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[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {165#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {165#(<= ~counter~0 0)} {165#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,352 INFO L272 TraceCheckUtils]: 11: Hoare triple {165#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {165#(<= ~counter~0 0)} [78] 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] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {165#(<= ~counter~0 0)} [81] 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[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {165#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {165#(<= ~counter~0 0)} {165#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {165#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:32:58,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {165#(<= ~counter~0 0)} [83] L41-2-->L36-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] {214#(<= |main_#t~post6| 0)} is VALID [2022-04-07 20:32:58,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {214#(<= |main_#t~post6| 0)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {158#false} is VALID [2022-04-07 20:32:58,359 INFO L272 TraceCheckUtils]: 19: Hoare triple {158#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {158#false} is VALID [2022-04-07 20:32:58,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {158#false} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {158#false} is VALID [2022-04-07 20:32:58,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {158#false} [92] L16-->L17: Formula: (= 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[] {158#false} is VALID [2022-04-07 20:32:58,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {158#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-07 20:32:58,361 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-07 20:32:58,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:32:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:32:58,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457825382] [2022-04-07 20:32:58,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:32:58,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843307214] [2022-04-07 20:32:58,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843307214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:32:58,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:32:58,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 20:32:58,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743535175] [2022-04-07 20:32:58,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:32:58,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23 [2022-04-07 20:32:58,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:32:58,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-07 20:32:58,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:32:58,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 20:32:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:32:58,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 20:32:58,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 20:32:58,385 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-07 20:32:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:58,434 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 20:32:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 20:32:58,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23 [2022-04-07 20:32:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:32:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-07 20:32:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-07 20:32:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-07 20:32:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-07 20:32:58,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-07 20:32:58,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:32:58,467 INFO L225 Difference]: With dead ends: 27 [2022-04-07 20:32:58,468 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 20:32:58,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-07 20:32:58,470 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-07 20:32:58,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:32:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 20:32:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 20:32:58,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:32:58,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-07 20:32:58,475 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-07 20:32:58,475 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-07 20:32:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:58,478 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 20:32:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 20:32:58,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:32:58,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:32:58,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 27 states. [2022-04-07 20:32:58,481 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 27 states. [2022-04-07 20:32:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:58,485 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 20:32:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 20:32:58,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:32:58,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:32:58,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:32:58,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:32:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-07 20:32:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-07 20:32:58,489 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-07 20:32:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:32:58,489 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-07 20:32:58,490 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-07 20:32:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 20:32:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 20:32:58,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:32:58,494 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:32:58,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 20:32:58,713 WARN L460 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-07 20:32:58,714 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:32:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:32:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-04-07 20:32:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:32:58,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135530459] [2022-04-07 20:32:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:32:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:32:58,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:32:58,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25607305] [2022-04-07 20:32:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:32:58,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:32:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:32:58,735 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-07 20:32:58,737 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-07 20:32:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:58,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 20:32:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:58,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:32:58,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {337#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:32:58,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} [72] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {337#true} is VALID [2022-04-07 20:32:58,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:32:58,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {337#true} {337#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:32:58,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {337#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:32:58,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {337#true} is VALID [2022-04-07 20:32:58,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {337#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {337#true} is VALID [2022-04-07 20:32:58,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#true} [78] 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] {337#true} is VALID [2022-04-07 20:32:58,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#true} [81] 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[] {337#true} is VALID [2022-04-07 20:32:58,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {337#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:32:58,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {337#true} {337#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {337#true} is VALID [2022-04-07 20:32:58,986 INFO L272 TraceCheckUtils]: 11: Hoare triple {337#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {337#true} is VALID [2022-04-07 20:32:58,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {337#true} [78] 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] {378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 20:32:58,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [81] 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[] {382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:32:58,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {382#(not (= |assume_abort_if_not_#in~cond| 0))} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:32:58,988 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {382#(not (= |assume_abort_if_not_#in~cond| 0))} {337#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {389#(not (= main_~x2~0 0))} is VALID [2022-04-07 20:32:58,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {389#(not (= main_~x2~0 0))} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-07 20:32:58,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [83] L41-2-->L36-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] {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-07 20:32:58,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-07 20:32:58,990 INFO L272 TraceCheckUtils]: 19: Hoare triple {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {403#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:32:58,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {403#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {407#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:32:58,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {407#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= 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[] {338#false} is VALID [2022-04-07 20:32:58,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {338#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#false} is VALID [2022-04-07 20:32:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 20:32:58,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:32:58,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:32:58,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135530459] [2022-04-07 20:32:58,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:32:58,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25607305] [2022-04-07 20:32:58,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25607305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:32:58,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:32:58,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 20:32:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781957575] [2022-04-07 20:32:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:32:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-07 20:32:58,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:32:58,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:32:59,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:32:59,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 20:32:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:32:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 20:32:59,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-07 20:32:59,017 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:32:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:59,199 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-07 20:32:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 20:32:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-07 20:32:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:32:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:32:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-07 20:32:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:32:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-07 20:32:59,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-07 20:32:59,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:32:59,235 INFO L225 Difference]: With dead ends: 35 [2022-04-07 20:32:59,235 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 20:32:59,236 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-07 20:32:59,238 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 20:32:59,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 20:32:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 20:32:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-07 20:32:59,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:32:59,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 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-07 20:32:59,247 INFO L74 IsIncluded]: Start isIncluded. First operand 35 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-07 20:32:59,247 INFO L87 Difference]: Start difference. First operand 35 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-07 20:32:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:59,252 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-07 20:32:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-07 20:32:59,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:32:59,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:32:59,258 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 35 states. [2022-04-07 20:32:59,259 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 35 states. [2022-04-07 20:32:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:32:59,262 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-07 20:32:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-07 20:32:59,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:32:59,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:32:59,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:32:59,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:32:59,264 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-07 20:32:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-07 20:32:59,266 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-07 20:32:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:32:59,266 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-07 20:32:59,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:32:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-07 20:32:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 20:32:59,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:32:59,267 INFO L499 BasicCegarLoop]: 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] [2022-04-07 20:32:59,283 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-07 20:32:59,471 WARN L460 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-07 20:32:59,472 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:32:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:32:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-04-07 20:32:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:32:59,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756194475] [2022-04-07 20:32:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:32:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:32:59,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:32:59,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978316577] [2022-04-07 20:32:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:32:59,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:32:59,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:32:59,493 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-07 20:32:59,494 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-07 20:32:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:59,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 20:32:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:32:59,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:32:59,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:32:59,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} [72] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {554#true} is VALID [2022-04-07 20:32:59,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:32:59,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:32:59,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:32:59,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {554#true} is VALID [2022-04-07 20:32:59,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:32:59,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} [78] 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] {554#true} is VALID [2022-04-07 20:32:59,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} [81] 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[] {554#true} is VALID [2022-04-07 20:32:59,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:32:59,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:32:59,692 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:32:59,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} [78] 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] {554#true} is VALID [2022-04-07 20:32:59,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} [81] 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[] {554#true} is VALID [2022-04-07 20:32:59,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:32:59,693 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:32:59,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#true} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {554#true} is VALID [2022-04-07 20:32:59,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {554#true} [83] L41-2-->L36-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] {554#true} is VALID [2022-04-07 20:32:59,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {554#true} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {554#true} is VALID [2022-04-07 20:32:59,693 INFO L272 TraceCheckUtils]: 19: Hoare triple {554#true} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {554#true} is VALID [2022-04-07 20:32:59,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:32:59,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:32:59,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:32:59,695 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {623#(not (= |__VERIFIER_assert_#in~cond| 0))} {554#true} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {630#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-07 20:32:59,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {630#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} [94] L37-1-->L36-3: Formula: (= v_main_~y3~0_8 0) InVars {main_~y3~0=v_main_~y3~0_8} OutVars{main_~y3~0=v_main_~y3~0_8} AuxVars[] AssignedVars[] {634#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-07 20:32:59,697 INFO L272 TraceCheckUtils]: 25: Hoare triple {634#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:32:59,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:32:59,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= 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[] {555#false} is VALID [2022-04-07 20:32:59,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {555#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#false} is VALID [2022-04-07 20:32:59,698 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-07 20:32:59,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:33:07,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {555#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#false} is VALID [2022-04-07 20:33:07,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= 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[] {555#false} is VALID [2022-04-07 20:33:07,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:33:07,334 INFO L272 TraceCheckUtils]: 25: Hoare triple {634#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:33:07,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {661#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} [94] L37-1-->L36-3: Formula: (= v_main_~y3~0_8 0) InVars {main_~y3~0=v_main_~y3~0_8} OutVars{main_~y3~0=v_main_~y3~0_8} AuxVars[] AssignedVars[] {634#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-07 20:33:07,335 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {623#(not (= |__VERIFIER_assert_#in~cond| 0))} {554#true} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {661#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-07 20:33:07,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:33:07,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {674#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:33:07,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {674#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 20:33:07,337 INFO L272 TraceCheckUtils]: 19: Hoare triple {554#true} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {554#true} is VALID [2022-04-07 20:33:07,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {554#true} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {554#true} is VALID [2022-04-07 20:33:07,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {554#true} [83] L41-2-->L36-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] {554#true} is VALID [2022-04-07 20:33:07,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#true} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {554#true} is VALID [2022-04-07 20:33:07,338 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:33:07,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:33:07,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} [81] 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[] {554#true} is VALID [2022-04-07 20:33:07,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} [78] 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] {554#true} is VALID [2022-04-07 20:33:07,338 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:33:07,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:33:07,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:33:07,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} [81] 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[] {554#true} is VALID [2022-04-07 20:33:07,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} [78] 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] {554#true} is VALID [2022-04-07 20:33:07,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:33:07,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {554#true} is VALID [2022-04-07 20:33:07,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:33:07,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:33:07,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:33:07,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} [72] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {554#true} is VALID [2022-04-07 20:33:07,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:33:07,340 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-07 20:33:07,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:33:07,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756194475] [2022-04-07 20:33:07,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:33:07,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978316577] [2022-04-07 20:33:07,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978316577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:33:07,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:33:07,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 20:33:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111771811] [2022-04-07 20:33:07,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:33:07,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-07 20:33:07,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:33:07,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:33:07,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:33:07,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 20:33:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:33:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 20:33:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 20:33:07,372 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:33:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:33:07,554 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-07 20:33:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 20:33:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-07 20:33:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:33:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:33:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-07 20:33:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:33:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-07 20:33:07,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-04-07 20:33:07,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:33:07,587 INFO L225 Difference]: With dead ends: 37 [2022-04-07 20:33:07,587 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 20:33:07,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-07 20:33:07,588 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:33:07,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:33:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 20:33:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-07 20:33:07,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:33:07,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-07 20:33:07,591 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-07 20:33:07,591 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-07 20:33:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:33:07,592 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-07 20:33:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-07 20:33:07,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:33:07,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:33:07,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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 34 states. [2022-04-07 20:33:07,593 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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 34 states. [2022-04-07 20:33:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:33:07,594 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-07 20:33:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-07 20:33:07,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:33:07,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:33:07,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:33:07,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:33:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-07 20:33:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-07 20:33:07,595 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-07 20:33:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:33:07,595 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-07 20:33:07,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:33:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-07 20:33:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 20:33:07,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:33:07,596 INFO L499 BasicCegarLoop]: trace histogram [2, 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-07 20:33:07,615 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-07 20:33:07,811 WARN L460 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-07 20:33:07,812 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:33:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:33:07,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-04-07 20:33:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:33:07,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993414028] [2022-04-07 20:33:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:33:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:33:07,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:33:07,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036289867] [2022-04-07 20:33:07,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:33:07,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:33:07,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:33:07,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 20:33:07,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 20:33:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 20:33:07,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 20:33:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 20:33:07,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 20:33:07,898 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 20:33:07,899 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 20:33:07,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 20:33:08,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:33:08,130 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-07 20:33:08,131 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 20:33:08,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:33:08 BasicIcfg [2022-04-07 20:33:08,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 20:33:08,148 INFO L158 Benchmark]: Toolchain (without parser) took 11132.12ms. Allocated memory was 181.4MB in the beginning and 260.0MB in the end (delta: 78.6MB). Free memory was 128.2MB in the beginning and 230.6MB in the end (delta: -102.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 20:33:08,148 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 20:33:08,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.40ms. Allocated memory is still 181.4MB. Free memory was 128.0MB in the beginning and 156.8MB in the end (delta: -28.8MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-04-07 20:33:08,148 INFO L158 Benchmark]: Boogie Preprocessor took 33.47ms. Allocated memory is still 181.4MB. Free memory was 156.8MB in the beginning and 155.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 20:33:08,148 INFO L158 Benchmark]: RCFGBuilder took 262.71ms. Allocated memory is still 181.4MB. Free memory was 155.1MB in the beginning and 144.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 20:33:08,149 INFO L158 Benchmark]: IcfgTransformer took 40.27ms. Allocated memory is still 181.4MB. Free memory was 144.1MB in the beginning and 142.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 20:33:08,149 INFO L158 Benchmark]: TraceAbstraction took 10585.17ms. Allocated memory was 181.4MB in the beginning and 260.0MB in the end (delta: 78.6MB). Free memory was 142.1MB in the beginning and 230.6MB in the end (delta: -88.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 20:33:08,150 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.40ms. Allocated memory is still 181.4MB. Free memory was 128.0MB in the beginning and 156.8MB in the end (delta: -28.8MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.47ms. Allocated memory is still 181.4MB. Free memory was 156.8MB in the beginning and 155.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 262.71ms. Allocated memory is still 181.4MB. Free memory was 155.1MB in the beginning and 144.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 40.27ms. Allocated memory is still 181.4MB. Free memory was 144.1MB in the beginning and 142.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 10585.17ms. Allocated memory was 181.4MB in the beginning and 260.0MB in the end (delta: 78.6MB). Free memory was 142.1MB in the beginning and 230.6MB in the end (delta: -88.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=6, counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [\old(counter)=0, counter=0, x1=2, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [\old(counter)=0, counter=0, x1=2, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=2, x2=1, y1=0, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=2, x2=1, y1=0, y2=0, y3=2] [L36] COND TRUE counter++<1 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=1, x1=2, x2=1, y1=0, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=2, x2=1, y1=0, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=2, x2=1, y1=1, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=2, x2=1, y1=1, y2=0, y3=1] [L36] COND FALSE !(counter++<1) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=2] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 99 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=3, InterpolantAutomatonStates: 23, 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, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 11 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 29 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-07 20:33:08,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...